Commitment under uncertainty: Two-stage stochastic matching problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4596 LNCS, Issue , 2007, Pages 171-182

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

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; UNCERTAINTY ANALYSIS;

BIPARTITE MATCHING PROBLEM; STOCHASTIC MATCHING PROBLEMS;

STOCHASTIC CONTROL SYSTEMS;

EID: 38149134451     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_17     Document Type: Conference Paper

References (24)

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