An edge in time saves nine: LP rounding approximation algorithms for stochastic network design

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

Volumn , Issue , 2004, Pages 218-227

  Gupta, Anupam ^a   Ravi, R ^b   Sinha, Amitabh ^c  

^a Carnegie Mellon University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK PLANNING PROBLEM; ROUTING; STOCHASTIC NETWORK DESIGN; STOCHASTIC STEINER TREES;

ALGORITHMS; FUNCTIONS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING; TREES (MATHEMATICS);

COMPUTATIONAL COMPLEXITY;

EID: 17744400754     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

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. (Preliminary version in 23rd STOC, 1991).
2. Baruch Awerbuch and Yossi Azar. Buy-at-bulk network design. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, pages 542-547, 1997.
3. Baruch Awerbuch, Yossi Azar, and Serge Plotkin. Throughput-competitive online routing. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pages 32-40, 1993.
4. E. M. L. Beale. On minimizing a convex function subject to linear inequalities. J. Roy. Statist. Soc. Ser. B., 17:173-184; discussion, 194-203, 1955. (Symposium on linear programming.).
5. D. Bienstock and O. Günluk. Capacitated network design - polyhedral structure and computation. INFORMS Journal on Computing, 8(3):243-259, 1996.
6. John R. Birge and François Louveaux. Introduction to stochastic programming. Springer Series in Operations Research. Springer-Verlag, New York, 1997.
7. Allan Borodin and Ran El-Yaniv. Online computation and competitive analysis. Cambridge University Press, New York, 1998.
8. Robert D. Carr, Lisa Fleischer, Vitus J. Leung, and Cynthia A. Phillips. Strengthening integrality gaps for capacitated network design and covering problems. In Symposium on Discrete Algorithms, pages 106-115, 2000.
9. George B. Dantzig. Linear programming under uncertainty. Management Sci., 1:197-206, 1955.
10. Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the thirty-fifth ACM symposium on Theory of computing, pages 448-455. ACM Press, 2003.
11. Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, and Amitabh Sinha. On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design formulation. In Proceedings of the 8th Integer Programming and Combinatorial Optimization Conference, volume 2081 of Lecture Notes in Computer Science, pages 170-184, 2001.
12. Michel X. Goemans and David P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput., 24(2):296-317, 1995. (Preliminary version in 5th SODA, 1994).
13. Sudipto Guha, Adam Meyerson, and Kamesh Mungala. A constant factor approximation for the single sink edge installation problems. In Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing (STOC), pages 383-388, 2001.
14. Anupam Gupta, Amit Kumar, and Tim 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.
15. Anupam Gupta, Martin Pal, R. Ravi, and Amitabh Sinha. Boosted sampling: Approximation algorithms for stochastic optimization problems. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 417-425, 2004.
16. Refael Hassin, R. Ravi, and F. S. Salman. Approximation algorithms for a capacitated network design problem. In APPROX, pages 167-176, 2000.
17. Ara Hayrapetyan, Chaitanya Swamy, and Éva Tardos. Network design for information networks. Manuscript, 2004.
18. H. Heitsch and W. Römisch. Scenario reduction algorithms in stochastic programming. Computational Optimization and Applications, 24:187-206, 2003.
19. Makoto Imase and Bernard M. Waxman. Dynamic Steiner tree problem. SIAM J. Discrete Math., 4(3):369-384, 1991.
20. 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, pages 684-693, 2004.
21. Peter Kall and Stein W. Wallace. Stochastic programming. Wiley-Interscience Series in Systems and Optimization. John Wiley & Sons Ltd., Chichester, 1994.
22. David R. Karger and Maria Minkoff. Building Steiner trees with incomplete global knowledge. In Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science, pages 613-623, 2000.
23. Samir Khuller, Balaji Raghavachari, and Neal E. Young. Balancing minimum spanning and shortest path trees. Algorithmica, 14(4):305-322, 1995.
24. Willem K. Klein Haneveld and Maarten H. van der Vlerk. Stochastic integer programming: general models and algorithms. Ann. Oper. Res., 85:39-57, 1999. Stochastic programming. State of the art, 1998 (Vancouver, BC).
25. Willem K. Klein Haneveld and Maarten H. van der Vlerk. Stochastic Programming. Department of Econometrics and OR, University of Groningen, Netherlands, 2003.
26. T. L. Magnanti, P. Mirchandani, and R. Vachani. Modeling and solving the capacitated network loading problem. Operations Research, 43:142-157, 1995.
27. T. L. Magnanti and R. T. Wong. Network design and transportation planning: Models and algorithms. Transportation Science, 18:1-55, 1984.
28. Yishay Mansour and David Peleg. An approximation algorithm for minimum-cost network design. In Robust communication networks: interconnection and survivability (New Brunswick, NJ, 1998), volume 53 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 97-106. Amer. Math. Soc., Providence, RI, 2000.
29. M. W. Padberg, T. J. Van Roy, and L. A. Wolsey. Valid linear inequalities for fixed charge problems. Operations Research, 33:842-861, 1985.
30. Michael Pinedo. Scheduling: Theory, Algorithms, and Systems. Prentice Hall, 1995.
31. R. Ravi and F. S. Salman. Approximation algorithms for the traveling purchaser problem and its variants in network design. In Algorithms - ESA '99(Prague), volume 1643 of Lecture Notes in Comput. Sci., pages 29-40. Springer, Berlin, 1999.
32. R. Ravi and Amitabh Sinha. Hedging uncertainty: Approximation algorithms for stochastic optimization problems. In Proceedings of the 10th Integer Programming and Combinatorial Optimization Conference, pages 101-115, 2004.
33. Gabriel Robins and Alexander Zelikovsky. Improved Steiner tree approximation in graphs. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 770-779, 2000.
34. F. Sibel Salman, Joseph Cheriyan, R. Ravi, and Sairam Subramanian. Approximating the single-sink link-installation problem in network design. SIAM Journal on Optimization, 11(3):595-610, 2000.
35. R. Schultz, L. Stougie, and M. H. van der Vlerk. Two-stage stochastic integer programming: a survey. Statist. Neerlandica, 50(3):404-416, 1996.
36. 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.
37. Kunal Talwar. Single-sink buy-at-bulk LP has constant integrality gap. In Proceedings of the 9th Integer Programming and Combinatorial Optimization Conference, volume 2337 of Lecture Notes in Computer Science, pages 475-486, 2002.