Sciweavers

Share
COCOON
2005
Springer

The Reverse Greedy Algorithm for the Metric K-Median Problem

9 years 5 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 total distance to the remaining facilities. It stops when k facilities remain. We prove that, if the distance function is metric, then the approximation ratio of RGREEDY is between (logn/loglogn) and O(logn).  2005 Elsevier B.V. All rights reserved.
Marek Chrobak, Claire Kenyon, Neal E. Young
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where COCOON
Authors Marek Chrobak, Claire Kenyon, Neal E. Young
Comments (0)
books