Sciweavers

Share
STOC
1998
ACM

Approximation Schemes for Euclidean k-Medians and Related Problems

9 years 4 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 from each of the points of S to the nearest median is minimized. This paper gives an approximation scheme for the plane that for any c > 0 produces a solution of cost at most 1 + 1/c times the optimum and runs in time O(nO(c+1) ). The approximation scheme also generalizes to some problems related to k-median. Our methodology is to extend Arora’s [1, 2] techniques for the TSP, which hitherto seemed inapplicable to problems such as the k-median problem.
Sanjeev Arora, Prabhakar Raghavan, Satish Rao
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where STOC
Authors Sanjeev Arora, Prabhakar Raghavan, Satish Rao
Comments (0)
books