Abstract
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introduce minimum quantity commitments to balance workloads of suppliers, provide it a 3-approximation algorithm, and study its generalizations.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bar-Ilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. Journal of Algorithms 15(3), 385–415 (1993)
Bassok, Y., Anupindi, R.: Analysis of supply contracts with total minimum commitment. IIE Trans. 29, 373–381 (1997)
Chaudhuri, S., Garg, N., Ravie, R.: The p-neighbor k-center problem. Information Processing Letters 65(3), 131–134 (1998)
Dutton, R.D., Brigham, R.C.: A characterization of competition graphs. Discrete Appl. Math. 6, 315–317 (1983)
Dyer, M., Frieze, A.M.: A simple heuristic for the p-center problem. Operations Research Letters 3, 285–288 (1985)
Garey, M.R., Johnson, D.S.: Computers and Intractability – A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Hochbaum, D., Shmoys, D.B.: A best possible heuristic for the k-center problem. Mathematics of Operations Research 10, 180–184 (1985)
Hochbaum, D., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. Journal of the ACM 33, 533–550 (1986)
Hsu, W., Nemhauser, G.: Easy and hard bottleneck location problems. Discrete Applied Mathematics 1, 209–216 (1979)
Khuller, S., Pless, R., Sussmann, Y.J.: Fault tolerant k-center problems. Theoretical Computer Science 242(1–2), 237–245 (2000)
Khuller, S., Sussmann, Y.J.: The capacitated k -center problem. SIAM Journal on Discrete Mathematics 13(3), 403–418 (2000)
Krumke, S.O.: On a generalization of the p-center problem. Information Processing Letters 56(2), 67–71 (1995)
Plesnik, J.: 1987. Discrete Applied Mathematics 17, 263–268 (1987)
Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)
Xu, Z., Lim, A.: The bottleneck problem with minimum quantity commitments (long version) (September 2003), http://logistics.ust.hk/~xuzhou/doc/share.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lim, A., Xu, Z. (2004). The Bottleneck Problem with Minimum Quantity Commitments. In: Hagerup, T., Katajainen, J. (eds) Algorithm Theory - SWAT 2004. SWAT 2004. Lecture Notes in Computer Science, vol 3111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27810-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-27810-8_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22339-9
Online ISBN: 978-3-540-27810-8
eBook Packages: Springer Book Archive