Simple cost sharing schemes for multicommodity rent-or-buy and stochastic steiner tree

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 663-670

  Fleischer, Lisa ^a   Könemann, Jochen ^b   Leonardi, Stefano ^c   Schäfer, Guido ^d  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

^d TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximation algorithms; Cost sharing; Stochastic optimization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; LOGIC DESIGN; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

APPROXIMATION ALGORITHMS; COST SHARING; STOCHASTIC OPTIMIZATION; STOCHASTIC STEINER TREE PROBLEM (SST;

TREES (MATHEMATICS);

EID: 33748112412     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132609     Document Type: Conference Paper

References (16)

1. M. Andrews. Hardness of buy-at-bulk network design. In Proceedings, IEEE Symposium on Foundations of Computer Science, pages 115-124, 2004.
2. B. Awerbuch and Y. Azar. Buy-at-bulk network design. In Proceedings, IEEE Symposium on Foundations of Computer Science, pages 542-547, 1997.
3. A. Agrawal, P. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized Steiner problem in networks. SIAM J. Comput., 24:440-456, 1995.
4. Y. Bartal. Probabilistic Approximation of Metric Spaces and its Algorithmic Applications. In Proceedings, IEEE Symposium on Foundations of Computer Science, pages 184-193, 1996.
5. Y. Bartal. On approximating arbitrary metrics by tree metrics. In Proceedings, ACM Symposium on Theory of Computing, pages 161-168, 1998.
6. L. Becchetti, J. Könemann, S. Leonardi, and M. Pal. Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. In Proceedings, ACM-SIAM Symposium on Discrete Algorithms, pages 375-384, 2005.
7. M. Bern and P. Plassmann. The Steiner problem with edge lengths 1 and 2. Inform. Process. Lett., 32(4):171-176, 1989.
8. J. Fakcharoenphol, S. Rao and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings, ACM Symposium on Theory of Computing, pages 448-455, 2003.
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, 1979.
10. 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, IEEE Symposium on Foundations of Computer Science, pages 606-617, 2003.
11. A. Gupta, A. Kumar, and T. Roughgarden. Simpler and better approximation algorithms for network design. In Proceedings, ACM Symposium on Theory of Computing, pages 365-372, 2003.
12. A. Gupta and M. Pál. Stochastic Steiner trees without a root. In Proceedings, International Colloquium on Automata, Languages and Programming, pages 1051-1063, 2005.
13. A. Gupta, M. Pál, R. Ravi, and A. Sinha. Boosted sampling: Approximation algorithms for stochastic optimization. In Proceedings, ACM Symposium on Theory of Computing, pages 417-426, 2004.
14. A. Gupta, R. Ravi, and A. Sinha. An edge in time saves nine: LP rounding approximation algorithms. In Proceedings, IEEE Symposium on Foundations of Computer Science, pages 218-227, 2004.
15. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput., 24:296-317, 1995.
16. A. Kumar, A. Gupta, and T. Roughgarden. A constant factor approximation algorithm for the multicommodity rent-or-buy problem. In Proceedings, IEEE Symposium on Foundations of Computer Science, pages 333-344, 2002.