Facility Location with Dynamic Distance Functions

Journal of Combinatorial Optimization

Volumn 2, Issue 3, 1998, Pages 199-217

  Bhatia, Randeep ^a   Guha, Sudipto ^b   Khuller, Samir ^c   Sussmann, Yoram J ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b STANFORD UNIVERSITY   (United States)

^c University of Maryland ^*  (United States)

Author keywords

Approximation algorithms; Facility location; Graph algorithms; K center problem

Indexed keywords

EID: 2342539852     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009796525600     Document Type: Article

References (25)

1. J. Bar-Ilan, G. Kortsarz and D. Peleg, "How to allocate network centers," J. Algorithms vol. 15, pp. 385-415, 1993.
2. S. Chaudhuri, N. Garg, and R. Ravi, "The p-neighbor k-center problem," Information Processing Letters vol. 65, pp. 131-134, 1998.
3. Z. Drezner, "The p-centre problem - heuristic and optimal algorithms," J. Opl. Res. Soc. vol. 35, pp. 741-748, 1984.
4. M. Dyer and A. M. Frieze, "A simple heuristic for the p-center problem," Operations Research Letters vol. 3, pp. 285-288 1985.
5. M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, Freeman: San Francisco, 1978.
6. T. Gonzalez, "Clustering to minimize the maximum inter-cluster distance," Theoretical Computer Science vol. 38, pp. 293-306, 1985.
7. R. Hassin, "Approximation schemes for the restricted shortest path problems," Mathematics of Operations Research vol. 17, no. 1, pp. 36-42, Feb. 1992.
8. D. Hochbaum and A. Pathria, "Locating centers in dynamically changing network and related problems," Location Science, to appear.
9. D. Hochbaum and D. B. Shmoys, "A best possible heuristic for the k-center problem," Mathematics of Operations Research vol. 10, pp. 180-184, 1985.
10. D. Hochbaum and D. B. Shmoys, "A unified approach to approximation algorithms for bottleneck problems," Journal of the ACM vol. 33, no. 3, pp. 533-550, 1986.
11. W. L. Hsu and G. L. Nemhauser, "Easy and hard bottleneck location problems," Discrete Applied Mathematics vol. 1, pp. 209-216, 1979.
12. O. Kariv and S. L. Hakimi, "An algorithmic approach to network location problems. I: The p-centers," SIAM J. Appl. Math vol. 37, pp. 513-538, 1979.
13. rd Italian Conference on Algorithms and Complexity, LNCS 1203, 1997, pp. 37-48.
14. th Annual European Symposium on Algorithms, LNCS 1136, 1996, pp. 152-166.
15. S.O. Krumke, "On a generalization of the p-center problem," Information Processing Letters vol. 56, pp. 67-71, 1995.
16. H. L. Morgan and K. D. Levin, "Optimal program and data locations in computer networks," Communications of the ACM vol. 20, pp. 315-322, 1977.
17. nd ACM Symposium on Principles of Database Systems, 1983, pp. 258-266.
18. J. Plesnik, "A heuristic for the p-center problem in graphs," Discrete Applied Mathematics vol. 17, pp. 263-268, 1987.
19. R. Ravi and M. X. Goemans, "The constrained minimum spanning tree problem," SWAT 1996, pp. 66-75.
20. 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.
21. C. Toregas, R. Swain, C. Revelle and L. Bergman, "The location of emergency service facilities," Operations Research vol. 19, pp. 1363-1373 1971.
22. J. Van Leeuwen, Ed., Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity, The MIT Press/Elsevier, 1990.
23. R. Panigrahy and S. Vishwanathan, "An O(log* n) approximation algorithm for the asymmetric p-center problem," Journal of Algorithms vol. 27, pp. 259-268, 1998.
24. Q. Wang and K. H. Cheng, "A heuristic algorithm for the k-center problem with cost and usage weights," in Proc. of the Twenty-Eighth Annual Allerton Conference on Communication, Control, and Computing, 1990, pp. 324-333.
25. A. Warburton, "Approximation of pareto optima in multiple-objective, shortest path problems," Operations Research vol. 35, pp. 70-79, 1987.