The capacitated K-center problem (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1136, Issue , 1996, Pages 152-166

  Khuller, Samir ^a   Sussmann, Yoram J ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

APPROXIMATION FACTOR; EXTENDED ABSTRACTS; FACILITY LOCATION PROBLEM; K-CENTER PROBLEM; MAXIMUM DISTANCE; NP-HARD; POLYNOMIAL TIME APPROXIMATION ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 84958039556     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_53     Document Type: Conference Paper

References (17)

1. J. Bar-Ilan, G. Kortsarz and D. Peleg, "How to allocate network centers", J. Algorithms, 15:385-415, (1993).
2. T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, The MIT Press, 1989.
3. M. Dyer and A. M. Frieze, "A simple heuristic for the p-center problem", Operations Research Letters, Vol 3:285-288, (1985).
4. J. Edmonds and D. R. Fulkerson, ~Bottleneck extrema', Journal of Combinatorial Theory, Vol 8:299-306, (1970).
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).
6. U. Feige, "A threshold of In n for approximating set cover", Proc. of the 28 th ACM Symposium on the Theory of Computing, pages 314-318, (1996).
7. T. Gonzalez, "Clustering to minimize the maximum inter-cluster distance", Theoretical Computer Science, Vol 38:293-306, (1985).
8. M. R. Gaxey 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", Mathematics of Operations Research, Vol 10: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(3):533-550, (1986).
11. W. L. Hsu and G. L. Nemhauser, "Easy and hard bottleneck location problems", Discrete Applied Mathematics, Vol 1:209-216, (1979).
12. O. Lund and M. Yannakakis, "On the hardness of approximating minimization problems", Journal o] the ACM, Vol 41(5):960-981, (1994).
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).
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).
15. K. Murthy and g. Kam, "An approximation algorithm to the file allocation problem in computer networks", Proc. of 2nd ACM Symposium on Principles of Database Systems, pages 258-266, (1983).
16. J. Plesnik, "A heuristic for the p-center problem in graphs", Discrete Applied Mathematics, Vol 17:263-268, (1987)
17. C. Toregas, R. Swain, C. Revelle and L. Bergman, The location of emergency service facilities", Operations Research, Vol 19:1363-1373, (1971).