Advertisement

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

  • Kunal Talwar
Conference paper
Part of the Lecture Notes in Computer Science book series (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].

Keywords

Steiner Tree Network Design Problem Annual IEEE Symposium Constant Factor Approximation Building Cost 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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. 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. 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. 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. 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. 8.
    R. Epstein. “Linear programming and capacitated network loading”, Ph.D. Thesis, MIT, 1998.Google Scholar
  9. 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.CrossRefGoogle Scholar
  10. 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. 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.CrossRefGoogle Scholar
  12. 12.
    S. Khuller, B. Raghavachari, N. Young. “Balancing minimum spanning and shortest path trees”, Algorithmica, 14(4):305–321, 1994.MathSciNetCrossRefGoogle Scholar
  13. 13.
    P. Mirchandani. Ph.D. thesis, MIT, 1989.Google Scholar
  14. 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. 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. 16.
    T. Magnanti, P. Mirchandani, R. Vachani, “Modeling and solving the two-facility capacitated network loading problem”, Operations Research 43, 142–157, 1995.MathSciNetzbMATHCrossRefGoogle Scholar
  17. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Kunal Talwar
    • 1
  1. 1.University of CaliforniaBerkeleyUSA

Personalised recommendations