Sampling bounds for stochastic optimization

Lecture Notes in Computer Science

Volumn 3624, Issue , 2005, Pages 257-269

  Charikar, Moses ^a   Chekuri, Chandra ^b   Pál, Martin ^b  

^a Princeton University   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COSTS; DECISION THEORY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; VECTORS;

APPROXIMATION ALGORITHMS; OPTIMIZATION PROBLEMS; RANDOM EXTERNAL PARAMETERS; STOCHASTIC OPTIMIZATION;

OPTIMIZATION;

EID: 26944478897     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538462_22     Document Type: Conference Paper

References (15)

1. K. Dhamhere, R. Ravi and M. Singh. On two-stage Stochastic Minimum Spanning Trees. Proc. of IPCO, 2005.
2. A. Flaxman, A. Frieze, M. Krivelevich. On the random 2-stage minimum spanning tree. Proc. of SODA, 2005.
3. A. Gupta, M. Pál, R. Ravi, and A. Sinha. Boosted sampling: Approximation algorithms for stochastic optimization. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004.
4. A. Gupta, R. Ravi, and A. 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.
5. N. Immorlica, D. Karger, M. Minkoff, and V. 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.
6. A. J. Kleywegt, A. Shapiro, and T. Homem-De-Mello. The sample average approximation method for stochastic discrete optimization. SIAM J. on Optimization, 12:479-502, 2001.
7. M. Mahdian. Facility Location and the Analysis of Algorithms through Factor-Revealing Programs. Ph.D. Thesis, MIT, June 2004.
8. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
9. Stochastic Programming. A. Ruszczynski, and A. Shapiro editors. Vol 10 of Hand-book in Operations Research and Management Science, Elsevier 2003.
10. A. Shapiro. Montecarlo sampling methods. In A. Ruszczynski, and A. Shapiro editors, Stochastic Programming, Vol 10 of Handbook in Operations Research and Management Science, Elsevier 2003.
11. R. Ravi and A. Sinha. Hedging uncertainty: Approximation algorithms for stochastic optimization problems. In Proceedings of the 10th International Conference on Integer Programming and Combinatorial Optimization (IPCO), 2004.
12. R. Ravi and M. Singh. Personal communication, February 2005.
13. D. Shmoys and C. Swamy. Stochastic optimization is (almost) as easy as deterministic optimization. Proc. of FOCS, 2004.
14. D. Shmoys and C. Swamy. The Sample Average Approximation Method for 2-stage Stochastic Optimization. Manuscript, November 2004.
15. D. Shmoys and C. Swamy. Sampling-based Approximation Algorithms for Multistage Stochastic Optimization. Manuscript, 2005.