Facility location with dynamic distance functions
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.
- 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.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
- 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
- 9.D. Hochbaum, personal communication, Oct (1996).Google Scholar
- 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.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
- 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.R. Panigrahy, “An O(log n) approximation algorithm for the asymmetric p-center problem”, manuscript, 1995.Google Scholar
- 21.R. Ravi, M. X. Goemans, “The constrained minimum spanning tree problem”, SWAT 1996, 66–75.Google Scholar
- 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
- 24.J. Van Leeuwen, Ed., Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity, The MIT Press/Elsevier, 1990.Google Scholar
- 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.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