Sciweavers

Share
34 search results - page 1 / 7
» The Reverse Greedy Algorithm for the Metric K-Median Problem
Sort
View
JCSS
2002
199views more  JCSS 2002»
9 years 1 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»
9 years 5 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
8 years 11 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
9 years 7 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
IPL
2016
54views more  IPL 2016»
3 years 9 months ago
On the greedy algorithm for the Shortest Common Superstring problem with reversals
Gabriele Fici, Tomasz Kociumaka, Jakub Radoszewski...
books