Sciweavers

30 search results - page 1 / 6
» The Reverse Greedy Algorithm for the Metric K-Median Problem
Sort
View
JCSS
2002
199views more  JCSS 2002»
13 years 3 months ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...
STOC
1998
ACM
139views Algorithms» more  STOC 1998»
13 years 7 months ago
Approximation Schemes for Euclidean k-Medians and Related Problems
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...
Sanjeev Arora, Prabhakar Raghavan, Satish Rao
FOCS
2010
IEEE
13 years 1 months ago
Stability Yields a PTAS for k-Median and k-Means Clustering
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
Pranjal Awasthi, Avrim Blum, Or Sheffet
COCOON
2005
Springer
13 years 9 months ago
The Reverse Greedy Algorithm for the Metric K-Median Problem
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...
Marek Chrobak, Claire Kenyon, Neal E. Young
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
13 years 5 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller