{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:44:25Z","timestamp":1750308265396,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,6,13]],"date-time":"2004-06-13T00:00:00Z","timestamp":1087084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,6,13]]},"DOI":"10.1145\/1007352.1007419","type":"proceedings-article","created":{"date-parts":[[2004,7,20]],"date-time":"2004-07-20T15:55:38Z","timestamp":1090338938000},"page":"417-426","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":86,"title":["Boosted sampling"],"prefix":"10.1145","author":[{"given":"Anupam","family":"Gupta","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]},{"given":"Martin","family":"P\u00e1l","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]},{"given":"Amitabh","family":"Sinha","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]}],"member":"320","published-online":{"date-parts":[[2004,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1111\/j.2517-6161.1955.tb00191.x","article-title":"On minimizing a convex function subject to linear inequalities","volume":"17","author":"Beale E. M. L.","unstructured":"E. M. L. Beale . On minimizing a convex function subject to linear inequalities . J. Roy. Statist. Soc. Ser. B. , 17 : 173 -- 184 ; discussion, 194--203, 1955. (Symposium on linear programming. ). E. M. L. Beale. On minimizing a convex function subject to linear inequalities. J. Roy. Statist. Soc. Ser. B., 17:173--184; discussion, 194--203, 1955. (Symposium on linear programming. ).","journal-title":"J. Roy. Statist. Soc. Ser. B."},{"key":"e_1_3_2_1_2_1","series-title":"Springer Series in Operations Research","volume-title":"Birge and Fran\u00e7ois Louveaux Introduction to stochastic programming","author":"John","year":"1997","unstructured":"John R. Birge and Fran\u00e7ois Louveaux Introduction to stochastic programming . Springer Series in Operations Research . Springer-Verlag , New York , 1997 . John R. Birge and Fran\u00e7ois Louveaux Introduction to stochastic programming. Springer Series in Operations Research. Springer-Verlag, New York, 1997."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.1.3-4.197"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796473"},{"key":"e_1_3_2_1_5_1","first-page":"606","volume-title":"Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science","author":"Gupta Anupam","year":"2003","unstructured":"Anupam Gupta , Amit Kumar , Martin P\u00e1l , and Tim Roughgarden . Approximations via cost-sharing . In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science , pages 606 -- 615 , 2003 . Anupam Gupta, Amit Kumar, Martin P\u00e1l, and Tim Roughgarden. Approximations via cost-sharing. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 606--615, 2003."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780597"},{"key":"e_1_3_2_1_7_1","first-page":"684","volume-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Immorlica Nicole","year":"2004","unstructured":"Nicole Immorlica , David Karger , Maria Minkoff , and Vahab 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 , pages 684 -- 693 , 2004 . Nicole Immorlica, David Karger, Maria Minkoff, and Vahab 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, pages 684--693, 2004."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380825"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509956"},{"key":"e_1_3_2_1_10_1","volume-title":"Stochastic programming","author":"Kall Peter","year":"1994","unstructured":"Peter Kall and Stein W. Wallace . Stochastic programming . Wiley-Interscience Series in Systems and Optimization. John Wiley & Sons Ltd ., Chichester, 1994 . Peter Kall and Stein W. Wallace. Stochastic programming. Wiley-Interscience Series in Systems and Optimization. John Wiley & Sons Ltd., Chichester, 1994."},{"key":"e_1_3_2_1_11_1","first-page":"613","volume-title":"Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science","author":"David","year":"2000","unstructured":"David R. Karger and Maria Minkoff. Building Steiner trees with incomplete global knowledge . In Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science , pages 613 -- 623 , 2000 . David R. Karger and Maria Minkoff. Building Steiner trees with incomplete global knowledge. In Proceedings of the 41th Annual IEEE Symposium on Foundations of Computer Science, pages 613--623, 2000."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018930113099"},{"key":"e_1_3_2_1_13_1","volume-title":"Klein Haneveld and Maarten H. van der Vlerk. Stochastic Programming. Department of Econometrics and OR","author":"Willem","year":"2003","unstructured":"Willem K. Klein Haneveld and Maarten H. van der Vlerk. Stochastic Programming. Department of Econometrics and OR , University of Groningen , Netherlands , 2003 . Willem K. Klein Haneveld and Maarten H. van der Vlerk. Stochastic Programming. Department of Econometrics and OR, University of Groningen, Netherlands, 2003."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797329142"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796586"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331530"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00004200"},{"key":"e_1_3_2_1_18_1","first-page":"584","volume-title":"Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science","author":"Martin","year":"2003","unstructured":"Martin P\u00e1l and \u00c9va Tardos. Group strategyproof mechanisms via primal-dual algorithms . In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science , pages 584 -- 593 , 2003 . Martin P\u00e1l and \u00c9va Tardos. Group strategyproof mechanisms via primal-dual algorithms. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 584--593, 2003."},{"key":"e_1_3_2_1_19_1","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"Pinedo Michael","year":"1995","unstructured":"Michael Pinedo . Scheduling: Theory, Algorithms, and Systems . Prentice Hall , 1995 . Michael Pinedo. Scheduling: Theory, Algorithms, and Systems. Prentice Hall, 1995."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25960-2_8"},{"key":"e_1_3_2_1_22_1","first-page":"770","volume-title":"Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Robins Gabriel","year":"2000","unstructured":"Gabriel Robins and Alexander Zelikovsky . Improved Steiner tree approximation in graphs . In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 770 -- 779 , 2000 . Gabriel Robins and Alexander Zelikovsky. Improved Steiner tree approximation in graphs. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 770--779, 2000."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9574.1996.tb01506.x"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/365411.365543"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0736-4679(94)90283-6"}],"event":{"name":"STOC04: Symposium of Theory of Computing 2004","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"STOC04"},"container-title":["Proceedings of the thirty-sixth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007419","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1007352.1007419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:23:56Z","timestamp":1750267436000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1007352.1007419"}},"subtitle":["approximation algorithms for stochastic optimization"],"short-title":[],"issued":{"date-parts":[[2004,6,13]]},"references-count":25,"alternative-id":["10.1145\/1007352.1007419","10.1145\/1007352"],"URL":"https:\/\/doi.org\/10.1145\/1007352.1007419","relation":{},"subject":[],"published":{"date-parts":[[2004,6,13]]},"assertion":[{"value":"2004-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}