The bottleneck problem with minimum quantity commitments

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

Volumn 3111, Issue , 2004, Pages 285-297

  Lim, Andrew ^a   Xu, Zhou ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

BOTTLENECK PROBLEM; EDGE DISTANCE; MAXIMUM DISTANCE;

ARTIFICIAL INTELLIGENCE;

EID: 35048850015     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27810-8_25     Document Type: Article

References (15)

1. Judit Bar-Ilan, Guy Kortsarz, and David Peleg. How to allocate network centers. Journal of Algorithms, 15(3):385-415, November 1993.
2. Y. Bassok and R. Anupindi. Analysis of supply contracts with total minimum commitment. IIE Trans, 29:373-381, May 1997.
3. Shiva Chaudhuri, Naveen Garg, and R. Ravie. The p-neighbor k-center problem. Information Processing Letters, 65(3):131-134, 1998.
4. R.D. Dutton and R.C. Brigham. A characterization of competition graphs. Discrete Appl. Math., 6:315-317, 1983.
5. M. Dyer and A. M. Frieze. A simple heuristic for the p-center problem. Operations Research Letters, 3:285-288, 1985.
6. M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
7. D. Hochbaum and D. B. Shmoys. A best possible heuristic for the k-center problem. Mathematics of Operations Research, 10:180-184, 1985.
8. D. Hochbaum and D. B. Shmoys. A unified approach to approximation algorithms for bottleneck problems. Journal of the ACM, 33:533-550, 1986.
9. W. Hsu and G. Nemhauser. Easy and hard bottleneck location problems. Discrete Applied Mathematics, 1:209-216, 1979.
10. Samir Khuller, Robert Pless, and Yoram J. Sussmann. Fault tolerant k-center problems. Theoretical Computer Science, 242(1-2):237-245, 2000.
11. Samir Khuller and Yoram J. Sussmann. The capacitated k -center problem. SIAM Journal on Discrete Mathematics, 13(3):403-418, 2000.
12. Sven Oliver Krumke. On a generalization of the p-center problem. Information Processing Letters, 56(2):67-71, 1995.
13. J. Plesnik. A heuristic for the p-center problem in graphs. Discrete Applied Mathematics, 17:263-268, 1987.
14. Vijay V. Vazirani. Approximation Algorithms. Springer-Verlag, 2001.
15. Zhou Xu and Andrew Lim. The bottleneck problem with minimum quantity commitments (long version). http://logistics.ust.hk/∼xuzhou/doc/share.html, Sept. 2003.