Abstract
The k-median problem differs from the facility location problem in two respects — there is no cost for opening facilities and there is an upper bound, k, on the number of facilities that can be opened. It models the problem of finding a minimum cost clustering, and therefore has numerous applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Notes
Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proc. 37th IEEE Annual Symposium on Foundations of Computer Science,pages 184–193, 1996. (Cited on p. 253)
M. Charikar, S. Guha, E. Tardos, and D.B. Shmoys. A constant-factor approximation algorithm for the k-median problem. In Proc. 31st ACM Symposium on the Theory of Computing,pages 1–10, 1999. (Cited on p. 253)
J. H. Lin and J. S. Vitter. r-approximation with minimum packing constraint violation. In Proc. Nth ACM Symposium on the Theory of Computing,pages 771–782, 1992. (Cited on p. 253)
K. Jain and V.V. Vazirani. Approximation algorithms for the metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. Journal of the ACM, 48:274–296, 2001. (Cited on pp. 241, 252, 253 )
V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit. Local search heuristics for k-median and facility location problems. In Proc. 33rd ACM Symposium on the Theory of Computing,2001. (Cited on pp. 252, 253)
K. Jain, M. Mandian, and A. Saberi. A new greedy approach for facility location problems. In Proc. 34th ACM Symposium on the Theory of Computing,2002. (Cited on pp. 254, 331)
M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and k-median problems. In Proc. 40th IEEE Annual Symposium on Foundations of Computer Science, pages 378–388, 1999. (Cited on p. 254)
P. Drineas, R. Kannan, A. Frieze, S. Vempala, and V. Vinay. Clustering in large graphs and matrices. In Proc. 10th ACM-SIAM Annual Symposium on Discrete Algorithms,pages 291–299, 1999. (Cited on p. 254)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Vazirani, V.V. (2003). k-Median. In: Approximation Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04565-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-662-04565-7_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08469-0
Online ISBN: 978-3-662-04565-7
eBook Packages: Springer Book Archive