Commitment under uncertainty: Two-stage stochastic matching problems

Theoretical Computer Science

Volumn 408, Issue 2-3, 2008, Pages 213-223

  Katriel, Irit ^a   Kenyon Mathieu, Claire ^a   Upfal, Eli ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

Matching algorithm; Stochastic combinatorial optimization

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; CONTROL THEORY; OPTIMIZATION; RESERVATION SYSTEMS; STOCHASTIC PROGRAMMING;

BIPARTITE MATCHING PROBLEMS; EFFICIENT; LOWER BOUNDS; MATCHING ALGORITHM; SCHEDULING UNDER UNCERTAINTIES; STOCHASTIC COMBINATORIAL OPTIMIZATION; STOCHASTIC INTEGRALS; STOCHASTIC MATCHING; STOCHASTIC OPTIMIZATIONS;

STOCHASTIC MODELS;

EID: 55049136138     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.08.010     Document Type: Article

References (24)

1. Birge J., and Louveaux F. Introduction to Stochastic Programming (1997), Springer
2. Charikar M., Chekuri C., and Pal M. Sampling bounds fpr stochastic optimization. APPROX-RANDOM (2005) 257-269
3. Chlebík M., and Chlebíková J. Inapproximability results for bounded variants of optimization problems. FCT. LNCS vol. 2751 (2003) 27-38
4. Dhamdhere K., Goyal V., Ravi R., and Singh M. How to pay, come what may: Approximation algorithms for demand-robust covering problems. FOCS (2005) 367-378
5. Dhamdhere K., Ravi R., and Singh M. On two-stage stochastic minimum spanning trees. IPCO. LNCS vol. 3509 (2005) 321-334
6. Dye S., Stougie L., and Tomasgard A. The stochastic single resource service-provision problem. Naval Research Logistics 50 (2003) 257-269
7. Elbassioni K.M., Katriel I., Kutz M., and Mahajan M. Simultaneous matchings. ISAAC. LNCS vol. 3827 (2005) 106-115
8. Flaxman A.D., Frieze A.M., and Krivelevich M. On the random 2-stage minimum spanning tree. SODA (2005) 919-926
9. Gupta A., and Pál M. Stochastic steiner trees without a root. ICALP. LNCS vol. 3580 (2005) 1051-1063
10. Gupta A., Pál M., Ravi R., and Sinha A. Boosted sampling: Approximation algorithms for stochastic optimization. STOC (2004), ACM 417-426
11. Gupta A., Ravi R., and Sinha A. An edge in time saves nine: LP rounding approx. algorithms for stochastic network design. FOCS (2004) 218-227
12. Immorlica N., Karger D., Minkoff M., and Mirrokni V.S. On the costs and benefits of procratination: Approximation algorithms for stochastic combinatorial optimization problems. SODA (2004) 691-700
13. Kenyon C., and Rémila E. A near-optimal solution to a two-dimensional cutting stock problem. Math. Oper. Res. 25 4 (2000) 645-656
14. Kong N., and Schaefer A.J. A factor 1/2 approximation algorithm for two-stage stochastic matching problems. Eur. J. Oper. Res. 172 (2006) 740-746
15. Lawler E. Combinatorial Optimization: Networks and Matroids (1976), Holt, Rinehart, Winston
16. Papadimitriou C.H., and Yannakakis M. Optimization, approximation, and complexity classes. J. Comput. System Sci. 43 (1991) 425-440
17. Ravi R., and Sinha A. Hedging uncertainty: Approximation algorithms for stochastic optimization problems. IPCO. LNCS vol. 3064 (2004) 101-115
18. Raz R., and Safra S. A sub-constant error-prob. low-degree test, and a sub-constant error-prob. PCP characterization of NP. STOC (1997) 475-484
19. D.B. Shmoys, M. Sozio, Approximation algorithms for 2-stage stochastic scheduling problems, in: IPCO, 2007
20. Shmoys D.B., and Swamy C. The Sample Average Approximation Method for 2-Stage Stochastic Optimization (2004)
21. Shmoys D.B., and Swamy C. Stochastic optimization is almost as easy as deterministic optimization. FOCS (2004) 228-237
22. Swamy C., and Shmoys D.B. The sampling-based approximation algorithms for multi-stage stochastic optimization. FOCS (2005) 357-366
23. Swamy C., and Shmoys D.B. Algorithms column: Approximation algorithms for 2-stage stochastic optimization problems. ACM SIGACT News 37 1 (2006) 33-46
24. Verweij B., Ahmed S., Kleywegt A.J., Nemhauser G., and Shapiro A. The sample average approximation method applied to stochastic routing problems: A computational study. Comput. Optim. Appl. 24 (2003) 289-333