Approximation algorithms for non-uniform buy-at-bulk network design

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 677-686

  Chekuri, C ^a   Hajiaghayi, M T ^b   Kortsarz, G ^c   Salavatipour, M R ^d  

^a University of Illinois at Urbana Champaign   (United States)

^b Carnegie Mellon University

^c RUTGERS UNIVERSITY   (United States)

^d UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

NON-UNIFORM BUY-AT-BULK NETWORK; POLY-LOGARITHMIC APPROXIMATION; UNIFORM-DEMAND CASE;

GRAPH THEORY; METRIC SYSTEM; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS;

EID: 34250370296     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.15     Document Type: Conference Paper

References (25)

1. N. Alon, R. Karp, D. Peleg and D. West. A graph theoretic game and its application to the k-server problem. SIAM J. on Computing, 24(1):78-100, 1995.
2. M. Andrews. Hardness of buy-at-bulk network design. Proc. of IEEE FOCS, 115-124, 2004.
3. M. Andrews and L. Zhang. The access network design problem. Algorithmica, 197-215, 2002
4. Preliminary version in Proc. of IEEE FOCS, 1998.
5. B. Awerbuch and Y. Azar. Buy-at-bulk network design. Proc. of IEEE FOCS, 542-547, 1997.
6. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. Proc. of IEEE FOCS, 184-193, 1996.
7. M. Charikar and A. Karagiozova. On non-uniform multicommodity buy-at-bulk network design. Proc of ACM STOC, 176-182, 2005.
8. C. Chekuri. Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design Problems. Manuscript, February 2006.
9. C. Chekuri, S. Khanna and J. Naor. A Deterministic Approximation Algorithm for the Cost-Distance Problem. Short paper in Proc. of ACM-SIAM SODA, 232-233, 2001.
10. J. Chuzhoy, A. Gupta, J. Naor and A. Sinha. On the Approximability of Some Network Design Problems. Proc of ACMSIAM SODA, 943-951, 2005.
11. M. Elkin, Y. Emek, D. Spielman and S. Teng. Lower stretch spanning trees. Proc. of ACM STOC, 494-503, 2005.
12. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. JCSS, 69:485-497, 2004.
13. Preliminary version in Proc. of ACM STOC, 2003.
14. A. Gupta, A. Kumar, M. Pal, and T. Roughgarden. Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem. Proc of IEEE FOCS, 606-615, 2003.
15. A. Gupta, A. Kumar, and T. Roughgarden. Simpler and better approximation algorithms for network design. Proc of ACM STOC, 365-372, 2003.
16. S. Guha, A. Meyerson and K. Munagala. A constant factor approximation for the single sink edge installation problem. Proc. of ACM STOC, 383-388, 2001.
17. M. Hajiaghayi, K. Jain. The Prize-Collecting Generalized Steiner Tree Problem via a new approach of Primal-Dual Schema. Proc. of ACM-SIAM SODA, 631-640, 2006.
18. M. Hajiaghayi, G. Kortsarz and M. Salavatipour. Approximating Buy-at-Bulk and Shallow-light k-Steiner trees, In proceedings of APPROX 2006, LNCS 4110, pp 153-163, 2006.
19. M. Hajiaghayi, G. Kortsarz and M. Salavatipour. Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk. Manuscript, November 2005. ECCC Report TR06-008, 2006.
20. D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences. Vol 9, 256-278,1974.
21. A. Kumar, A. Gupta, and T. Roughgarden. A constant-factor approximation algorithm for the multicommodity rent-or-buy problem. Proc. of IEEE FOCS, 333-342, 2002.
22. M. Marathe, R. Ravi, R. Sundaram, S. S. Ravi, D. Rosenkrantz, H. B. Hunt. Bicriteria network design. Journal of Algorithms, 28(1):142-171, 1998.
23. A. Meyerson, K. Munagala, and S. Plotkin. Cost-Distance: Two Metric Network Design. Proc. of IEEE FOCS, 383-388, 2000.
24. F. S. Salman, J. Cheriyan, R. Ravi, and S. Subramanian. Buy at bulk network design: Approximating the single-sink edge installation problem. Proc. of ACM-SIAM SODA, 619-628, 1997.
25. K. Talwar. The single-sink buy-at-bulk LP has constant integrality gap. Proc. of IPCO, 475-486, LNCS, 2002.