Stochastic steiner trees without a root

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1051-1063

  Gupta, Anupam ^a   Pál, Martin ^b  

^a Carnegie Mellon University   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

PROBABILITY DISTRIBUTION; STOCHASTIC OPTIMIZATION; SUBSETS;

COMPUTER SCIENCE;

EID: 26444460210     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_85     Document Type: Conference Paper

References (21)

1. Ajit Agrawal, Philip Klein, and R. Ravi. When trees collide: an approximation algorithm for the generalized steiner problem on networks. SIAM J. Comput., 24(3):440-456, 1995.
2. (Preliminary version in 23rd STOC, 1991).
3. E. M. L. Beale. On minimizing a convex function subject to linear inequalities. J. Roy. Statist. Soc. Ser. B., 17:173-184;
4. discussion, 194-203, 1955. (Symposium on linear programming.).
5. Luca Becchetti, Jochen Könemann, Stefano Leonardi, and Martin Pál. Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005.
6. John R. Birge and François Louveaux. Introduction to stochastic programming. Springer Series in Operations Research. Springer-Verlag, New York, 1997.
7. George B. Dantzig. Linear programming under uncertainty. Management Sci., 1:197-206, 1955.
8. Michel X. Goemans and David P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput., 24(2):296-317, 1995.
9. (Preliminary version in 5th SODA, 1994).
10. Anupam Gupta, Amit Kumar, Martin Pal, and Tim 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.
11. Anupam Gupta, Martin Pál, R. Ravi, and Amitabh Sinha. Boosted sampling: Approximation algorithms for stochastic optimization. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004.
12. Anupam Gupta, R. Ravi, and Amitabh Sinha. An edge in time saves nine: Lp rounding approximation algorithms. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004.
13. Ara Hayrapetyan, Chaitanya Swamy, and Éva Tardos. Network design for information networks. In ACM-SIAM Symposium on Discrete Algorithms, 2005.
14. Nicole Immorlica, David Karger, Maria Minkoff, and Vahab Mirrokni. On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004.
15. Peter Kall and Stein W. Wallace. Stochastic programming. Wiley-Interscience Series in Systems and Optimization. John Wiley & Sons Ltd., Chichester, 1994.
16. David R. Karger and Maria Minkoff. Building steiner trees with incomplete global knowledge. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pages 613-623, 2000.
17. Jochen Könemann, Stefane Leonardi, and Guido Schäffer. A group-strategyproof mechanism for steiner forests. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005.
18. Amit Kumar, Anupam Gupta, and Tim Roughgarden. A constant factor approximation algorithm for the multicommodity rent-or-buy problem. In Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, 2002.
19. R. Ravi and Amitabh Sinha. Hedging uncertainty: Approximation algorithms for stochastic optimization problems. In Proceedings of the 10th International Conference on Integer Programming and Combinatorial Optimization (IPCO), 2004. GSIA Working Paper 2003-E68.
20. R. Schultz, L. Stougie, and M. H. van der Vlerk. Two-stage stochastic integer programming: a survey. Statist. Nederlandica, 50(3):404-416, 1996.
21. David Shmoys and Chaitanya Swamy. Stochastic optimization is (almost) as easy as deterministic optimization. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004.