On non-uniform multicommodity buy-at-bulk network design

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 176-182

  Charikar, Moses ^a   Karagiozova, Adriana ^a  

^a Princeton University   (United States)

Author keywords

Approximation algorithms; Buy at bulk; Multicommodity; Network design; Non uniform

Indexed keywords

APPROXIMATION ALGORITHMS; BUY-AT-BULK; MULTICOMMODITY; NETWORK DESIGN; NON-UNIFORM;

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; GRAPH THEORY; SET THEORY;

PROBLEM SOLVING;

EID: 34848840958     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060617     Document Type: Conference Paper

References (18)

1. N. Alon, S. Hoory and N. Liriial. The Moore bound for irregular graphs. In Graphs and Combinatorics 18, pages 53-57, 2002.
2. M. Andrews. Hardness of Buy-at-Bulk Network Design. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pages 115-124, 2004.
3. M. Andrews and L. Zhang. Bounds on Fiber Minimization in Optical Networks. In Proceedings of 2005 IEEE INFOCOM, 2005.
4. B. Awerbuch, Y. Azar and Y. Bartal, On-line Generalized Steiner Problem. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 68-74, 1996.
5. B.Awerbuch and Y. Azar. Buy-At-Bulk Network Design. In Proceeding of the 38th Annual IEEE Symposium on Foundations of Computer Science, pages 542-547, 1997.
6. Y. Bartal. Probabilistic Approximation of Metric Spaces and its Algorithmic Applications. InProceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 184-193, 1996.
7. Y. Bartal. On Approximating Arbitrary Metrics by Tree Metrics. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 183-193, 1998.
8. C. Chekuri, S. Khanna and J. Naor. A deterministic algorithm for the cost-distance problem. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 232-233, 2001.
9. J. Fakcharoenphol, S. Rao and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 448-455, 2003.
10. S. Guha, A. Meyerson and K. Munagala. A constant factor approximation for the single sink edge installation problems. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pages 383-388, 2001.
11. A. Gupta, A. Kumar, M. Pal and T. Roughgarden. Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 606-615, 2003.
12. A. Gupta, A. Kumar and T. Roughgarden. Simpler and better approximation algorithms for network design. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pages 365-372, 2003.
13. A. Kumar, A. Gupta and T. Roughgarden. A Constant Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem, In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 333-, 2002.
14. A. Meyerson. Online algorithms for network design. In Proceedings of the 16th ACM Symposium on Parallelism in Algorithms and Architectures, pages 275-280, 2004.
15. A. Meyerson, K. Munagala and S. Plotkin, Cost-Distance: Two-Metric Network Design. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 624-630, 2000.
16. A. Meyerson, K. Munagala and S. Plotkin. Designing Networks Incrementally. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 406-415, 2001.
17. S. Salman, J. Cheryian, R. Ravi, S. Subramanian. Buy-at-bulk network design: approximating the single-sink edge installation problem. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 619-628, 1997.
18. K. Talwar. Single-sink buy-at-bulk LP has constant integrality gap. In Proceedings of the 9th IPCO, LNCS vol 2337, pages 475-486, 2002.