Abstract
In the k-median problem we are given a set S of n points in a metric space and a positive integer k: The objective is to locate k medians among the points so that the sum of the distances from each point in S to its closest median is minimized. The k-median problem is a well-studied, NP-hard, basic clustering problem which is closely related to facility location.We examine the version of the problem in Euclidean space. Obtaining approximations of good quality had long been an elusive goal and only recently Arora, Raghavan and Rao gave a randomized polynomial-time approximation scheme for the Euclidean plane by extending techniques introduced originally by Arora for Euclidean TSP. For any fixed ε > 0, their algorithm outputs a (1 + ε)-approximation in O(nkn O(1/ε) log n) time.
In this paper we provide a randomized approximation scheme for points in d- dimensional Euclidean space, with running time O(21/εd n log n log k); which is nearly linear for any fixed ε and d. Our algorithm provides the first polynomialtime approximation scheme for k-median instances in d-dimensional Euclidean space for any fixed d > 2: To obtain the drastic running time improvement we develop a structure theorem to describe hierarchical decomposition of solutions. The theorem is based on a novel adaptive decomposition scheme, which guesses at every level of the hierarchy the structure of the optimal solution and modifies accordingly the parameters of the decomposition. We believe that our methodology is of independent interest and can find applications to further geometric problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Arora. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In Proc. 37th FOCS, 2–11, 1996.
S. Arora. Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In Proc. 38th FOCS, 554–563, 1997.
S. Arora, P. Raghavan, and S. Rao. Polynomial time approximation schemes for the euclidean k-medians problem. In Proc. 30th STOC, 106–113, 1998.
Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proc. 37th FOCS, 184–193, 1996.
Y. Bartal. On approximating arbitrary metrics by tree metrics. In Proc. 30th STOC, 161–168, 1998.
M. Charikar, C. Chekuri, A. Goel, and S. Guha. Rounding via trees: deterministic approximation algorithms for group Steiner tree and k-median. In Proc. 39th FOCS, 114–123, 1998.
M. Charikar, S. Guha, E. Tardos, and D. Shmoys. A constant factor approximation algorithm for the k-median problem. To appear in Proc. STOC 99.
F. A. Chudak. Improved approximation algorithms for uncapacitated facility location. In R. E. Bixby, E. A. Boyd, and R. Z. Rios-Mercado, editors, Proc. 6th IPCO, volume 1412 of LNCS, 180–194. Springer-Verlag, Berlin, 1998.
G. Cornuéjols, G. L. Nemhauser, and L. A. Wolsey. The uncapacitated facility location problem. In P. Mirchandani and R. Francis, editors, Discrete Location Theory. John Wiley and Sons, Inc., NewYork, 1990.
T. Feder and D. H. Greene. Optimal algorithms for approximate clustering. In Proc. 20th STOC, 434–444, 1988.
T. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293–306, 1985.
S. Guha and S. Khuller. Greedy strikes back: improved facility location algorithms. In Proc. 9th SODA, 649–657, 1998.
D. S. Hochbaum. Heuristics for the fixed cost median problem. Mathematical Programming, 22:148–162, 1982.
J. H. Lin and J. S. Vitter. Approximation algorithms for geometric median problems. Information Processing Letters, 44:245–249, 1992.
J. H. Lin and J. S. Vitter. ∈-approximations with minimum packing constraint violation. In Proc. 24th STOC, 771–782, 1992.
G. Mitchell. Guillotine subdvisions approximate polygonal subdivisions: Part II-A simple PTAS for geometric k-MST, TSP and related problems. Preliminary manuscript, April 30 1996. To appear in SIAM J. Computing.
S. Rao and W. D. Smith. Improved approximation schemes for geometrical graphs via spanners and banyans. In Proc. STOC, 540–550, 1998.
D. B. Shmoys, E. Tardos, and K. I. Aardal. Approximation algorithms for facility location problems. In Proc. STOC, 265–274, 1997.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kolliopoulos, S.G., Rao, S. (1999). A Nearly Linear-Time Approximation Scheme for the Euclidean k-median Problem. In: Nešetřil, J. (eds) Algorithms - ESA’ 99. ESA 1999. Lecture Notes in Computer Science, vol 1643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48481-7_33
Download citation
DOI: https://doi.org/10.1007/3-540-48481-7_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66251-8
Online ISBN: 978-3-540-48481-3
eBook Packages: Springer Book Archive