Advertisement

Improved Approximation for Single-Sink Buy-at-Bulk

  • Fabrizio Grandoni
  • Giuseppe F. Italiano
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4288)

Abstract

In the single-sink buy-at-bulk network design problem we are given a subset of source nodes in a weighted undirected graph: each source node wishes to send a given amount of flow to a sink node. Moreover, a set of cable types is given, each characterized by a cost per unit length and by a capacity: the ratio cost/capacity decreases from small to large cables by economies of scale. The problem is to install cables on edges at minimum cost, such that the flow from each source to the sink can be routed simultaneously. The approximation ratio of this NP-hard problem was gradually reduced from O(log2 n) to 65.49 by a long series of papers. In this paper, we design a better 24.92 approximation algorithm for this problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Awerbuch, B., Azar, Y.: Buy-at-bulk network design. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 542–547 (1997)Google Scholar
  2. 2.
    Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 184–193 (1996)Google Scholar
  3. 3.
    Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 161–168 (1998)Google Scholar
  4. 4.
    Becchetti, L., Konemann, J., Leonardi, S., Pal, M.: Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 375–384 (2005)Google Scholar
  5. 5.
    Charikar, M., Chekuri, A., Goel, A., Guha, S.: Approximating a finite metric by a small number of tree metrics. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 379–388 (1998)Google Scholar
  6. 6.
    Eisenbrand, F., Grandoni, F.: An improved approximation algorithm for virtual private network design. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 928–932 (2005)Google Scholar
  7. 7.
    Eisenbrand, F., Grandoni, F., Oriolo, G., Skutella, M.: New approaches for virtual private network design. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1152–1162. Springer, Heidelberg (2005)Google Scholar
  8. 8.
    Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: ACM Symposium on the Theory of Computing (STOC), pp. 448–455 (2003)Google Scholar
  9. 9.
    Garg, N., Khandekar, R., Konjevod, G., Ravi, R., Salman, F., Sinha, A.: On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 170–184. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. 10.
    Guha, S., Meyerson, A., Munagala, K.: A constant factor approximation for the single sink edge installation problem. In: ACM Symposium on the Theory of Computing (STOC), pp. 383–388 (2001)Google Scholar
  11. 11.
    Gupta, A., Kleinberg, J., Kumar, A., Rastogi, R., Yener, B.: Provisioning a virtual private network: a network design problem for multicommodity flow. In: ACM Symposium on the Theory of Computing (STOC), pp. 389–398 (2001)Google Scholar
  12. 12.
    Gupta, A., Kumar, A., Pal, M., Roughgarden, T.: Approximation via cost-sharing: simpler and better approximation algorithms for network design (manuscript)Google Scholar
  13. 13.
    Gupta, A., Kumar, A., Pal, M., Roughgarden, T.: Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 606–617 (2003)Google Scholar
  14. 14.
    Gupta, A., Kumar, A., Roughgarden, T.: A constant-factor approximation algorithm for the multicommodity. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 333–344 (2002)Google Scholar
  15. 15.
    Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: ACM Symposium on the Theory of Computing (STOC), pp. 365–372 (2003)Google Scholar
  16. 16.
    Jothi, R., Raghavachari, B.: Improved approximation algorithms for the single-sink buy-at-bulk network design problems. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 336–348. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  17. 17.
    Kumar, A., Swamy, C.: Primal-dual algorithms for the connected facility location problem. In: International Workshop on Approximation Algorithms for Combinatorial Optimization, pp. 256–269 (2002)Google Scholar
  18. 18.
    Meyerson, A., Munagala, K., Plotkin, S.: Cost-distance: two metric network design. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 624–630 (2000)Google Scholar
  19. 19.
    Talwar, K.: The single-sink buy-at-bulk LP has constant integrality gap. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 475–486. Springer, Heidelberg (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Fabrizio Grandoni
    • 1
  • Giuseppe F. Italiano
    • 2
  1. 1.Dipartimento di InformaticaUniversità di Roma “La Sapienza”RomaItaly
  2. 2.Dipartimento di Informatica, Sistemi e ProduzioneUniversità di Roma “Tor Vergata”RomaItaly

Personalised recommendations