Advertisement

k-Median

  • Vijay V. Vazirani

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. 22.
    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)Google Scholar
  2. 40.
    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)Google Scholar
  3. 196.
    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)Google Scholar
  4. 148.
    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 )MathSciNetCrossRefGoogle Scholar
  5. 16.
    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)Google Scholar
  6. 145.
    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)Google Scholar
  7. 39.
    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)Google Scholar
  8. 66.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Personalised recommendations