Advertisement

The capacitated K-center problem

Extended abstract
  • Samir Khuller
  • Yoram J. Sussmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1136)

Abstract

The capacitated K-center problem is a fundamental facility location problem, where we are asked to locate K facilities in a graph, and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. Moreover, each facility may be assigned at most L vertices. This problem is known to be NP-hard. We give polynomial time approximation algorithms for two different versions of this problem that achieve approximation factors of 5 and 6. We also study some generalizations of this problem.

Keywords

Leaf Node Approximation Factor Free Node Discrete Apply Mathematic Polynomial Time Approximation Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Bar-Ilan, G. Kortsarz and D. Peleg, “How to allocate network centers”, J. Algorithms, 15:385–415, (1993).Google Scholar
  2. 2.
    T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, The MIT Press, 1989.Google Scholar
  3. 3.
    M. Dyer and A. M. Frieze, “A simple heuristic for the p-center problem”, Operations Research Letters, Vol 3:285–288, (1985).MathSciNetGoogle Scholar
  4. 4.
    J. Edmonds and D. R. Fulkerson, “Bottleneck extrema”, Journal of Combinatorial Theory, Vol 8:299–306, (1970).Google Scholar
  5. 5.
    T. Feder and D. Greene, “Optimal algorithms for approximate clustering”, Proc. of the 20 th ACM Symposium on the Theory of Computing, pages 434–444, (1988).Google Scholar
  6. 6.
    U. Feige, “A threshold of ln n for approximating set cover”, Proc. of the 28 th ACM Symposium on the Theory of Computing, pages 314–318, (1996).Google Scholar
  7. 7.
    T. Gonzalez, “Clustering to minimize the maximum inter-cluster distance”, Theoretical Computer Science, Vol 38:293–306, (1985).Google Scholar
  8. 8.
    M. R. Garey and D. S. Johnson, “Computers and Intractability: A guide to the theory of NP-completeness”, Freeman, San Francisco (1978).Google Scholar
  9. 9.
    D. Hochbaum and D. B. Shmoys, “A best possible heuristic for the k-center problem”, Mathematics of Operations Research, Vol 10:180–184, (1985).Google Scholar
  10. 10.
    D. Hochbaum and D. B. Shmoys, “A unified approach to approximation algorithms for bottleneck problems”, Journal of the ACM, Vol 33(3):533–550, (1986).Google Scholar
  11. 11.
    W. L. Hsu and G. L. Nemhauser, “Easy and hard bottleneck location problems”, Discrete Applied Mathematics, Vol 1:209–216, (1979).Google Scholar
  12. 12.
    C. Lund and M. Yannakakis, “On the hardness of approximating minimization problems”, Journal of the ACM, Vol 41(5):960–981, (1994).Google Scholar
  13. 13.
    R. Lupton, F. M. Maley, and N. E. Young, “Data collection for the Sloan digital sky survey — a network-flow heuristic”, Proc. of the 7 th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 296–303, (1996).Google Scholar
  14. 14.
    H. L. Morgan and K. D. Levin, “Optimal program and data locations in computer networks”, Communications of the ACM, Vol 20:315–322, (1977).CrossRefGoogle Scholar
  15. 15.
    K. Murthy and J. Kam, “An approximation algorithm to the file allocation problem in computer networks”, Proc. of 2 nd ACM Symposium on Principles of Database Systems, pages 258–266, (1983).Google Scholar
  16. 16.
    J. Plesnik, “A heuristic for the p-center problem in graphs”, Discrete Applied Mathematics, Vol 17:263–268, (1987)Google Scholar
  17. 17.
    C. Toregas, R. Swain, C. Revelle and L. Bergman, “The location of emergency service facilities”, Operations Research, Vol 19:1363–1373, (1971).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Samir Khuller
    • 1
  • Yoram J. Sussmann
    • 2
  1. 1.Dept. of Computer Science and UMIACSUniversity of MarylandCollege Park
  2. 2.Dept. of Computer ScienceUniversity of MarylandCollege Park

Personalised recommendations