Facility location with dynamic distance functions

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


Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlying network could be used to model a city street network for emergency facility location/hospitals, or an electronic network for locating information centers. In any case, it is clear that due to traffic congestion the traversal time on links changes with time. Very often, we have estimates as to how the edge lengths change over time, and our objective is to choose a set of locations (vertices) as centers, such that at every time instant each vertex has a center close to it (clearly, the center close to a vertex may change over time). We also provide approximation algorithms as well as hardness results for the K-center problem under this model. This is the first comprehensive study regarding approximation algorithms for facility location for good time-invariant solutions.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. Bar-Ilan, G. Kortsarz and D. Peleg, “How to allocate network centers”, J. Algorithms, 15:385–415, (1993).CrossRefMathSciNetMATHGoogle Scholar
  2. 2.
    R. Bhatia, S. Guha, S. Khuller and Y. J. Sussmann, “Facility location with dynamic distance functions”, Technical Report CS-TR-3834, UMIACS-TR-97-70, Univ of Maryland (1997).Google Scholar
  3. 3.
    S. Chaudhuri, N. Garg, and R. Ravi, “Best possible approximation algorithms for generalized k-Center problems”, Technical Report MPI-I-96-1-021, Max-Planck-Institut für Informatik, Im Stadtwald, 66123 Saarbrücken, Germany, (1996).Google Scholar
  4. 4.
    Z. Drezner, “The p-centre problem—heuristic and optimal algorithms”, J. Opl. Res. Soc. Vol 35:741–748, (1984).MATHGoogle Scholar
  5. 5.
    M. Dyer and A. M. Frieze, “A simple heuristic for the p-center problem”, Operations Research Letters, Vol 3:285–288, (1985).CrossRefMathSciNetMATHGoogle Scholar
  6. 6.
    M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, Freeman, San Francisco, 1978.Google Scholar
  7. 7.
    T. Gonzalez, “Clustering to minimize the maximum inter-cluster distance”, Theoretical Computer Science, Vol 38:293–306, (1985).MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    R. Hassin, “Approximation schemes for the restricted shortest path problems”, Mathematics of Operations Research, Vol 17:36–42, No 1. Feb. 1992.MATHMathSciNetGoogle Scholar
  9. 9.
    D. Hochbaum, personal communication, Oct (1996).Google Scholar
  10. 10.
    D. Hochbaum and D. B. Shmoys, “A best possible heuristic for the k-center problem”, Mathematics of Operations Research, Vol 10:180–184, (1985).MathSciNetMATHGoogle Scholar
  11. 11.
    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).CrossRefMathSciNetGoogle Scholar
  12. 12.
    W. L. Hsu and G. L. Nemhauser, “Easy and hard bottleneck location problems”, Discrete Applied Mathematics, Vol 1:209–216, (1979).CrossRefMathSciNetMATHGoogle Scholar
  13. 13.
    O. Kariv and S. L. Hakimi, “An algorithmic approach to network location problems. I: The p-centers”, SIAM J. Appl. Math, Vol 37:513–538, (1979).CrossRefMathSciNetMATHGoogle Scholar
  14. 14.
    S. Khuller, R. Pless, and Y. J. Sussmann, “Fault tolerant K-Center problems”, Proc. of the 3 rd Italian Conference on Algorithms and Complexity, LNCS 1203, pages 37–48, (1997).Google Scholar
  15. 15.
    S. Khuller and Y. J. Sussmann, “The capacitated K-Center problem”, Proc. of the 4 th Annual European Symposium on Algorithms, LNCS 1136, pages 152–166, (1996).Google Scholar
  16. 16.
    S. O. Krumke, “On a generalization of the p-center problem”, Information Processing Letters, Vol 56:67–71, (1995).CrossRefMathSciNetGoogle Scholar
  17. 17.
    H. L. Morgan and K. D. Levin, “Optimal program and data locations in computer networks”, Communications of the ACM, Vol 20:315–322, (1977).CrossRefMATHGoogle Scholar
  18. 18.
    K. Murthy and J. Kam, “An approximation algorithm to the file allocation problem in computer networks”, Proc. of the 2 nd ACM Symposium on Principles of Database Systems, pages 258–266, (1983).Google Scholar
  19. 19.
    R. Panigrahy, “An O(log n) approximation algorithm for the asymmetric p-center problem”, manuscript, 1995.Google Scholar
  20. 20.
    J. Plesnik, “A heuristic for the p-center problem in graphs”, Discrete Applied Mathematics, Vol 17:263–268, (1987)MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    R. Ravi, M. X. Goemans, “The constrained minimum spanning tree problem”, SWAT 1996, 66–75.Google Scholar
  22. 22.
    D. Serra and V. Marianov, “The P-median problem in a changing network: The case of Barcelona”, paper presented at the International Symposium in Locational Decisions VII, (ISOLDE), Edmonton, Canada, (1996).Google Scholar
  23. 23.
    C. Toregas, R. Swain, C. Revelle and L. Bergman, “The location of emergency service facilities”, Operations Research, Vol 19:1363–1373, (1971).MATHGoogle Scholar
  24. 24.
    J. Van Leeuwen, Ed., Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity, The MIT Press/Elsevier, 1990.Google Scholar
  25. 25.
    S. Vishwanathan, “An O(log* n) approximation algorithm for the asymmetric p-Center problem”, Proc. of the 7 th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1–5, (1996).Google Scholar
  26. 26.
    Q. Wang and K. H. Cheng, “A heuristic algorithm for the k-center problem with cost and usage weights”, Proc. of the Twenty-Eighth Annual Allerton Conference on Communication, Control, and Computing, pages 324–333, (1990).Google Scholar
  27. 27.
    A. Warburton, “Approximation of pareto optima in multiple-objective, shortest path problems”, Operations Research Vol 35:70–79, (1987).MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Randeep Bhatia
    • 1
    • 3
  • Sudipto Guha
    • 2
  • Samir Khuller
    • 1
  • Yoram J. Sussmann
    • 1
  1. 1.Dept. of Computer ScienceUniversity of MarylandCollege Park
  2. 2.Dept. of Computer ScienceStanford UniversityUSA
  3. 3.LCC Inc.McLean

Personalised recommendations