On the Costs and Benefits of Procrastination: Approximation Algorithms for Stochastic Combinatorial Optimization Problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 684-693

  Immorlica, Nicole ^a   Karger, David ^a   Minkoff, Maria ^a   Mirrokni, Vahab S ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONSTANT FACTOR APPROXIMATION; COST FUNCTION;

ALGORITHMS; COMBINATORIAL MATHEMATICS; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; RESOURCE ALLOCATION; SET THEORY; THEOREM PROVING;

STOCHASTIC PROGRAMMING;

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

References (14)

1. J.R. Birge. Stochastic programming and applications. INFORMS Journal on Computing, 9(2):111-133, spring 1997.
2. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proc. ACM Symposium on Theory of Computing, 2003.
3. M.R. Garey and D.S. Johnson. Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, 1979.
4. 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 Proc. 44th Annual Symposium on Foundations of Computer Science, Cambridge, MA, 2003.
5. A. Gupta, A. Kumar, and T. Roughgarden. Simpler and better approximation algorithms for network design. In Proc. ACM Symposium on Theory of Computing, pages 365-372, 2003.
6. A. Gupta, R. Ravi, and A. Sinha. Hedging uncertainty: Approximation algorithms for stochastic optimization problems. Working paper, 2004.
7. David R. Karger, Philip N. Klein, and Robert E. Tarjan. A randomized linear-time algorithm to find minimum spanning trees. Journal of the ACM, 42(2):321-328, March 1995.
8. J. Kleinberg, Y. Rabani, and É. Tardos. Allocating bandwidth for bursty connections. SIAM J. Computing, 30(1):191-217, 2000.
9. A. Kumar, A. Gupta, and T. Roughgarden. A constant factor approximation algorithm for the multicommodity rent-or-buy problem. In Proc. 43d Annual Symposium on Foundations of Computer Science, pages 333-342, 2002.
10. D. Mitra and Q. Wang. Stochastic traffic engineering, with applications to network revenue management. In Proceedings of IEEE INFOCOM 2003, 2003.
11. N.V. Sahinidis. Optimization under uncertainty: state-of-the-art and opportunities. University of Illinois,Urbana, February 2003.
12. H. Soroush and P. B. Mirchandani. The stochastic multicommodity flow problem. Networks, 20:121-155, 1990.
13. C. Swamy and A. Kumar. Primal-dual algorithms for connected facility location problems. In Proc. 5th APPROX, volume 2462 of LNCS, pages 256-269, 2002.
14. M. H. van der Vlerk. Stochastic programming bibliography. World Wide Web, http://mally.eco.rug.nl/spbib.html, 1996-2003.