The capacitated K-center problem

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 3, 2000, Pages 403-418

  Khuller, Samir ^a   Sussmann, Yoram J ^a,b  

^a University of Maryland ^*  (United States)

^b Fundtech Corporation   (United States)

Author keywords

Approximation algorithms; Facility location; K center

Indexed keywords

EID: 1842787482     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480197329776     Document Type: Article

References (18)

1. J. BAR-ILAN, G. KORTSARZ, AND D. PELEG, How to allocate network centers, J. Algorithms, 15 (1993), pp. 385-415.
2. T. CORMEN, C. LEISERSON, AND R. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1989.
3. M. DYER AND A. M. FRIEZE, A simple heuristic for the p-center problem. Oper. Res. Lett., 3 (1985), pp. 285-288.
4. J. EDMONDS AND D. R. FULKERSON, Bottleneck extrema, J, Combin. Theory, 8 (1970), pp 299-306.
5. T. FEDER AND D. H. GREENE, Optimal algorithms for approximate clustering, in Proceedings of the 20th ACM Symposium on the Theory of Computing, Chicago, IL, 1988, pp. 434-444.
6. U. FEIGE, A threshold of ln n for approximating set cover, in Proceedings of the 28th ACM Symposium on the Theory of Computing, Philadelphia, PA, 1996, pp. 314-318.
7. T. GONZALEZ, Clustering to minimize the maximum inter-cluster distance, Theoret. Comput. Sci., 38 (1985), pp. 293-306.
8. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1978.
9. D. HOCHBAUM AND D. B. SHMOYS, A best possible heuristic for the k-center problem, Math. Oper. Res., 10 (1985), pp. 180-184.
10. D. HOCHBAUM AND D. B. SHMOYS, A unified approach to approximation algorithms for bottleneck problems, J. ACM, 33 (1986), pp. 533-550.
11. W. L. HSU AND G. L. NEMHAUSER, Easy and hard bottleneck location problems, Discrete Appl. Math., 1 (1979), pp. 209-216.
12. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, J. ACM, 41 (1994), pp. 960-981.
13. R. LUPTON, F. M. MALEY, AND N. E. YOUNG, Data collection for the Sloan digital sky survey - A network-flow heuristic, in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, GA, SIAM, Philadelphia, PA. 1996, pp. 296-303.
14. H. L. MORGAN AND K. D. LEVIN, Optimal program and data locations in computer networks, Communications of the ACM, 20 (1977), pp. 315-322.
15. K. MURTHY AND J. KAM, An approximation algorithm to the file allocation problem in computer networks, in Proceedings of 2nd ACM Symposium on Principles of Database Systems, Atlanta, GA, 1983, pp. 258-266.
16. C. H. PAPADIMITRIOU AND K. STEIGLITZ, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NJ, 1982.
17. J. PLESNIK, A heuristic for the p-center problem in graphs, Discrete Appl. Math., 17 (1987), pp. 263-268.
18. C. TOREGAS, R. SWAIN, C. REVELLE, AND L. BERGMAN, The location of emergency service facilities, Oper. Res., 19 (1971), pp. 1363-1373.