Skip to main content
SpringerLink
Log in
Book cover

Scandinavian Workshop on Algorithm Theory

SWAT 2004: Algorithm Theory - SWAT 2004 pp 285–297Cite as

The Bottleneck Problem with Minimum Quantity Commitments

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3111))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bar-Ilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. Journal of Algorithms 15(3), 385–415 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bassok, Y., Anupindi, R.: Analysis of supply contracts with total minimum commitment. IIE Trans. 29, 373–381 (1997)

    Google Scholar 

  3. Chaudhuri, S., Garg, N., Ravie, R.: The p-neighbor k-center problem. Information Processing Letters 65(3), 131–134 (1998)

    Article  MathSciNet  Google Scholar 

  4. Dutton, R.D., Brigham, R.C.: A characterization of competition graphs. Discrete Appl. Math. 6, 315–317 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dyer, M., Frieze, A.M.: A simple heuristic for the p-center problem. Operations Research Letters 3, 285–288 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Computers and Intractability – A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  7. Hochbaum, D., Shmoys, D.B.: A best possible heuristic for the k-center problem. Mathematics of Operations Research 10, 180–184 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hochbaum, D., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. Journal of the ACM 33, 533–550 (1986)

    Article  MathSciNet  Google Scholar 

  9. Hsu, W., Nemhauser, G.: Easy and hard bottleneck location problems. Discrete Applied Mathematics 1, 209–216 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  10. Khuller, S., Pless, R., Sussmann, Y.J.: Fault tolerant k-center problems. Theoretical Computer Science 242(1–2), 237–245 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Khuller, S., Sussmann, Y.J.: The capacitated k -center problem. SIAM Journal on Discrete Mathematics 13(3), 403–418 (2000)

    Article  MathSciNet  Google Scholar 

  12. Krumke, S.O.: On a generalization of the p-center problem. Information Processing Letters 56(2), 67–71 (1995)

    Article  MathSciNet  Google Scholar 

  13. Plesnik, J.: 1987. Discrete Applied Mathematics 17, 263–268 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  14. Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)

    Google Scholar 

  15. Xu, Z., Lim, A.: The bottleneck problem with minimum quantity commitments (long version) (September 2003), http://logistics.ust.hk/~xuzhou/doc/share.html

Download references

Author information

Authors and Affiliations

  1. Dept Industrial Engineering and Engineering Management, Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong

    Andrew Lim & Zhou Xu

Authors
  1. Andrew Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhou Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Augsburg, 86135, Augsburg, Germany

    Torben Hagerup

  2. Department of Computing, University of Copenhagen, Denmark

    Jyrki Katajainen

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation