Metric k-center

Known as: K-center, Minimum k-center

In graph theory, the metric k-center or metric facility location problem is a combinatorial optimization problem studied in theoretical computer…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

Flexible and efficient CDNs are critical to facilitate content distribution in 5G+ architectures. Current CDNs suffer from…

2017

In some optimization problems, the objective function can be taken pretty literally. If one wants to maximize profit or…

2014

We study the min-max problem in factor graphs, which seeks the assignment that minimizes the maximum value over all factors. We…

2013

Now there is no good solution to the problem of geometric K-center gateway deployment in wireless mesh networks,and the problem…

2012

Collecting data from sensor nodes is the ultimate goal of Wireless Sensor Networks. This is performed by transmitting the sensed…

2011

We prove the computational hardness of three k-clustering problems using an (almost) arbitrary Bregman divergence as…

2010

Initialization of fuzzy k-means algorithm decreases the convergent rate of clustering and leads to plenty of calculation. Thus…

2010

Fuzzy k -means and vector quantization are combined in this paper to complement each other in incremental mode because each has…

2008

The objective of this research is to develop a procedure that will solve, contingent on a necessary and sufficient optimality…

2003

The fast Gauss transform proposed by Greengard and Strain reduces the computational complexity of the evaluation of the sum of N…