Skip to main content
SpringerLink
Log in
Book cover

International Conference on Integer Programming and Combinatorial Optimization

IPCO 2002: Integer Programming and Combinatorial Optimization pp 475–486Cite as

The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap

  • Conference paper
  • First Online:

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

Abstract

The buy-at-bulk network design problem is to design a minimum cost network to satisfy some flow demands, by installing cables from an available set of cables with different costs per unit length and capacities, where the cable costs obey economies of scale. For the single-sink buy-at-bulk problem, [10] gave the first constant factor approximation. In this paper, we use techniques of [9] to get an improved constant factor approximation. This also shows that the integrality gap of a natural linear programming formulation is a constant, thus answering the open question in [9].

Research partially supported by NSF via grants CCR-0105533 and CCR-9820897.

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. M. Andrews, L. Zhang. “The access network design problem”, Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 42–49, 1998.

    Google Scholar 

  2. B. Awerbuch, Y. Azar. “Buy-at-bulk network design”, Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, 542–547, 1997.

    Google Scholar 

  3. Y. Bartal. “Probabilistic approximation of metric spaces and its algorithmic applications”, Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 184–193, 1996.

    Google Scholar 

  4. Y. Bartal. “On approximating arbitrary metrics by tree metrics”, Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 161–168, 1998.

    Google Scholar 

  5. A. Balakrishnan, T. Magnanti, P. Mirchandani. “Network Design”, in Anottated bibliographies in combinatorial optimization, M. Dell’Amico, F. Maffioli and S. Martello(eds.), John Wiley and Sons, New York, 311–334, 1997.

    Google Scholar 

  6. M. Charikar, C. Chekuri, A. Goel, S. Guha. “Approximating a finite metric by a small number of tree metrics, Proceedings of the 39th Symposium on Foundations of Computer Science, 379–388, 1998.

    Google Scholar 

  7. B. Chandra, G. Das, G. Narasimhan, J. Soares. “New sparseness results for graph spanners”, Proc. of 8th Symposium on Computational Geometry, 192–201, 1992.

    Google Scholar 

  8. R. Epstein. “Linear programming and capacitated network loading”, Ph.D. Thesis, MIT, 1998.

    Google Scholar 

  9. N. Garg, R. Khandekar, G. Konjevod, R. Ravi, F.S. Salman, A. Sinha. “On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem”, Proceedings of the Eighth International Conference on Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science 2081, Springer, 170–184, 2001.

    Chapter  Google Scholar 

  10. S. Guha, A. Meyerson, K. Munagala. “A constant factor approximation for the single sink edge installation problem”, Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 383–388, 2001.

    Google Scholar 

  11. R. Hassin, R. Ravi, F.S. Salman. “Approximation algorithms for a capacitated network design problem”, Approximation algorithms for combinatorial optimization, Third International workshop, APPROX 2000, Proceedings, Lecture Notes in Computer Science 1913, Springer, 167–176, 2000.

    Chapter  Google Scholar 

  12. S. Khuller, B. Raghavachari, N. Young. “Balancing minimum spanning and shortest path trees”, Algorithmica, 14(4):305–321, 1994.

    Article  MathSciNet  Google Scholar 

  13. P. Mirchandani. Ph.D. thesis, MIT, 1989.

    Google Scholar 

  14. Y. Mansour, D. Peleg. “An approximation algorithm for minimum-cost network design”, The Weizman Institute of Science Tech. Report CS94-22.

    Google Scholar 

  15. A. Meyerson, K. Munagala, S. Plotkin. “Cost-distance: Two metric network design”, Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 624–630, 2000.

    Google Scholar 

  16. T. Magnanti, P. Mirchandani, R. Vachani, “Modeling and solving the two-facility capacitated network loading problem”, Operations Research 43, 142–157, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  17. F.S. Salman, J. Cheriyan, R. Ravi, S. Subramanian.” Buy-at-bulk network design: Approximating the single sink edge installation problem”, Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 619–628, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California, Berkeley, CA, 94720, USA

    Kunal Talwar

Authors
  1. Kunal Talwar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Program in Applied and Computational Mathematics, University of Princeton, Fine Hall, Washington Road, Princeton, NJ, 08544-1000, USA

    William J. Cook

  2. Sloan School of Management, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA, 02139-4307, USA

    Andreas S. Schulz

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Talwar, K. (2002). The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap. In: Cook, W.J., Schulz, A.S. (eds) Integer Programming and Combinatorial Optimization. IPCO 2002. Lecture Notes in Computer Science, vol 2337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47867-1_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-47867-1_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43676-8

  • Online ISBN: 978-3-540-47867-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation