{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T04:10:01Z","timestamp":1740543001562,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282396"},{"type":"electronic","value":"9783540318743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538462_8","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T04:13:22Z","timestamp":1285647202000},"page":"86-98","source":"Crossref","is-referenced-by-count":23,"title":["What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization"],"prefix":"10.1007","author":[{"given":"Anupam","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Martin","family":"P\u00e1l","sequence":"additional","affiliation":[]},{"given":"Ramamoorthi","family":"Ravi","sequence":"additional","affiliation":[]},{"given":"Amitabh","family":"Sinha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1111\/j.2517-6161.1955.tb00191.x","volume":"17","author":"E.M.L. Beale","year":"1955","unstructured":"Beale, E.M.L.: On minimizing a convex function subject to linear inequalities. J. Roy. Statist. Soc. Ser. B.\u00a017, 173\u2013184 (1955); discussion, 194\u2013203 (1955) (Symposium on linear programming)","journal-title":"J. Roy. Statist. Soc. Ser. B."},{"key":"8_CR2","series-title":"Springer Series in Operations Research","volume-title":"Introduction to stochastic programming","author":"J.R. Birge","year":"1997","unstructured":"Birge, J.R., Louveaux, F.: Introduction to stochastic programming. Springer Series in Operations Research. Springer, New York (1997)"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1287\/mnsc.1.3-4.197","volume":"1","author":"G.B. Dantzig","year":"1955","unstructured":"Dantzig, G.B.: Linear programming under uncertainty. Management Sci.\u00a01, 197\u2013206 (1955)","journal-title":"Management Sci."},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/11496915_24","volume-title":"Integer Programming and Combinatorial Optimization","author":"K. Dhamdhere","year":"2005","unstructured":"Dhamdhere, K., Ravi, R., Singh, M.: On two-stage stochastic minimum spanning trees. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol.\u00a03509, pp. 321\u2013334. Springer, Heidelberg (2005)"},{"key":"8_CR5","unstructured":"Gupta, A., Kumar, A., P\u00e1l, M., Roughgarden, T.: Approximations via cost-sharing. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 606\u2013615 (2003)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Gupta, A., P\u00e1l, M., Ravi, R., Sinha, A.: Boosted sampling: Approximation algorithms for stochastic optimization problems. In: Proceedings of the 36th ACM Symposium on the Theory of Computing (STOC), pp. 417\u2013426 (2004)","DOI":"10.1145\/1007352.1007419"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Gupta, A., Ravi, R., Sinha, A.: An edge in time saves nine: LP rounding approximation algorithms for stochastic network design. In: Proceedings of the 45th Symposium on the Foundations of Computer Science (FOCS), pp. 218\u2013227 (2004)","DOI":"10.1109\/FOCS.2004.11"},{"key":"8_CR8","unstructured":"Hayrapetyan, A., Swamy, C., Tardos, E.: Network design for information networks. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 933\u2013942 (2005)"},{"key":"8_CR9","unstructured":"Immorlica, N., Karger, D., Minkoff, M., Mirrokni, V.: 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, pp. 691\u2013700 (2004)"},{"key":"8_CR10","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.: Limitations of crossmonotonic cost-sharing schemes. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, SODA (2005)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Jain, K., Vazirani, V.: Applications of approximation algorithms to cooperative games. In: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing (STOC), pp. 364\u2013372 (2001)","DOI":"10.1145\/380752.380825"},{"key":"8_CR12","series-title":"Wiley-Interscience Series in Systems and Optimization","volume-title":"Stochastic programming","author":"P. Kall","year":"1994","unstructured":"Kall, P., Wallace, S.W.: Stochastic programming. Wiley-Interscience Series in Systems and Optimization. John Wiley & Sons Ltd., Chichester (1994)"},{"key":"8_CR13","unstructured":"Haneveld, W.K.K., van der Vlerk, M.H.: Stochastic Programming. Department of Econometrics and OR, University of Groningen, Netherlands (2003)"},{"issue":"3","key":"8_CR14","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/PL00004200","volume":"18","author":"H. Moulin","year":"2001","unstructured":"Moulin, H., Shenker, S.: Strategy proof sharing of submodular costs: budget balance versus efficiency. Econom. Theory\u00a018(3), 511\u2013533 (2001)","journal-title":"Econom. Theory"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"P\u00e1l, M., Tardos, \u00c9.: Group strategyproof mechanisms via primal-dual algorithms. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 584\u2013593 (2003)","DOI":"10.1109\/SFCS.2003.1238231"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Ravi, R., Sinha, A.: Hedging uncertainty: Approximation algorithms for stochastic optimization problems. In: Proceedings of the 10th Integer Programming and Combinatorial Optimization Conference, pp. 101\u2013115 (2004)","DOI":"10.1007\/978-3-540-25960-2_8"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1111\/j.1467-9574.1996.tb01506.x","volume":"50","author":"R. Schultz","year":"1996","unstructured":"Schultz, R., Stougie, L., van der Vlerk, M.H.: Two-stage stochastic integer programming: a survey. Statist. Neerlandica\u00a050(3), 404\u2013416 (1996)","journal-title":"Statist. Neerlandica"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Shmoys, D., Swamy, C.: Stochastic optimization is (almost) as easy as deterministic optimization. In: Proceedings of the 45th Symposium on the Foundations of Computer Science (FOCS), pp. 228\u2013237 (2004)","DOI":"10.1109\/FOCS.2004.62"},{"key":"8_CR19","unstructured":"Shmoys, D., Swamy, C.: Sampling-based approximation algorithms for multi-stage stochastic optimization (2005) (manuscript)"},{"key":"8_CR20","first-page":"1193","volume-title":"Handbook of Game Theory","author":"H.P. Young","year":"1994","unstructured":"Young, H.P.: Cost allocation. In: Aumann, R.J., Hart, S. (eds.) Handbook of Game Theory, vol.\u00a02, ch. 34, pp. 1193\u20131235. North-Holland, Amsterdam (1994)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538462_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T03:06:56Z","timestamp":1740539216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538462_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282396","9783540318743"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11538462_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}