{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:37Z","timestamp":1750307737269,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,5,31]],"date-time":"2009-05-31T00:00:00Z","timestamp":1243728000000},"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":[[2009,5,31]]},"DOI":"10.1145\/1536414.1536504","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T14:51:13Z","timestamp":1243954273000},"page":"659-668","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A constant-factor approximation for stochastic Steiner forest"],"prefix":"10.1145","author":[{"given":"Anupam","family":"Gupta","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, PIttsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792236237"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.32"},{"key":"e_1_3_2_1_3_1","volume-title":"38th FOCS, 542--547.","author":"Awerbuch B.","year":"1997","unstructured":"B. Awerbuch , Y. Azar . Buy-at-bulk network design . In 38th FOCS, 542--547. 1997 . B. Awerbuch, Y. Azar. Buy-at-bulk network design. In 38th FOCS, 542--547. 1997."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_22"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.15"},{"key":"e_1_3_2_1_6_1","volume-title":"19th SODA, 661--670.","author":"Chekuri C.","year":"2008","unstructured":"C. Chekuri , N. Korula , M. Pal . Improved algorithms for orienteering and related problems . In 19th SODA, 661--670. 2008 . C. Chekuri, N. Korula, M. Pal. Improved algorithms for orienteering and related problems. In 19th SODA, 661--670. 2008."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.10092"},{"key":"e_1_3_2_1_8_1","volume-title":"19th SODA, 1174--1183.","author":"Eisenbrand F.","year":"2008","unstructured":"F. Eisenbrand , F. Grandoni , T. Rothvo\u00df , G. Schafer . Approximating connected facility location problems via random facility sampling and core detouring . In 19th SODA, 1174--1183. 2008 . F. Eisenbrand, F. Grandoni, T. Rothvo\u00df, G. Schafer. Approximating connected facility location problems via random facility sampling and core detouring. In 19th SODA, 1174--1183. 2008."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132609"},{"key":"e_1_3_2_1_10_1","volume-title":"LNCS","volume":"2081","author":"Garg N.","year":"2001","unstructured":"N. Garg , R. Khandekar , G. Konjevod , R. Ravi , F. S. Salman , A. Sinha . On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design formulation. In 8th IPCO , LNCS , vol. 2081 , 170--184. 2001 . N. Garg, R. Khandekar, G. Konjevod, R. Ravi, F. S. Salman, A. Sinha. On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design formulation. In 8th IPCO, LNCS, vol. 2081, 170--184. 2001."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380827"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_10"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236457.1236458"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_85"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007419"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1060.0237"},{"key":"e_1_3_2_1_19_1","volume-title":"16th SODA, 933--942.","author":"Hayrapetyan A.","year":"2005","unstructured":"A. Hayrapetyan , C. Swamy , E. Tardos . Network design for information networks . In 16th SODA, 933--942. 2005 . A. Hayrapetyan, C. Swamy, E. Tardos. Network design for information networks. In 16th SODA, 933--942. 2005."},{"key":"e_1_3_2_1_20_1","volume-title":"15th SODA, 684--693.","author":"Immorlica N.","year":"2004","unstructured":"N. Immorlica , D. Karger , M. Minkoff , V. Mirrokni . On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems . In 15th SODA, 684--693. 2004 . N. Immorlica, D. Karger, M. Minkoff, V. Mirrokni. On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In 15th SODA, 684--693. 2004."},{"key":"e_1_3_2_1_21_1","volume-title":"43rd FOCS, 333--342.","author":"Kumar A.","year":"2002","unstructured":"A. Kumar , A. Gupta , T. Roughgarden . A constant-factor approximation algorithm for the multicommodity rent-or-buy problem . In 43rd FOCS, 333--342. 2002 . A. Kumar, A. Gupta, T. Roughgarden. A constant-factor approximation algorithm for the multicommodity rent-or-buy problem. In 43rd FOCS, 333--342. 2002."},{"key":"e_1_3_2_1_22_1","volume-title":"10th IPCO, 101--115.","author":"Ravi R.","year":"2004","unstructured":"R. Ravi , A. Sinha . Hedging uncertainty: Approximation algorithms for stochastic optimization problems . In 10th IPCO, 101--115. 2004 . R. Ravi, A. Sinha. Hedging uncertainty: Approximation algorithms for stochastic optimization problems. In 10th IPCO, 101--115. 2004."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217860"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2007.02.005"}],"event":{"name":"STOC '09: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Bethesda MD USA","acronym":"STOC '09"},"container-title":["Proceedings of the forty-first annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536504","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1536414.1536504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:51Z","timestamp":1750253931000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,31]]},"references-count":24,"alternative-id":["10.1145\/1536414.1536504","10.1145\/1536414"],"URL":"https:\/\/doi.org\/10.1145\/1536414.1536504","relation":{},"subject":[],"published":{"date-parts":[[2009,5,31]]},"assertion":[{"value":"2009-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}