{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T06:38:58Z","timestamp":1784356738647,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540327554","type":"print"},{"value":"9783540327561","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_50","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"532-543","source":"Crossref","is-referenced-by-count":28,"title":["Stochastic Covering and Adaptivity"],"prefix":"10.1007","author":[{"given":"Michel","family":"Goemans","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Vondr\u00e1k","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"50_CR1","unstructured":"Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: SODA, pp. 106\u2013115 (2000)"},{"issue":"4","key":"50_CR2","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1137\/S0097539799356265","volume":"33","author":"C. Chekuri","year":"2004","unstructured":"Chekuri, C., Khanna, S.: On multidimensional packing problems. SIAM J. Computing\u00a033(4), 837\u2013851 (2004)","journal-title":"SIAM J. Computing"},{"key":"50_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A greedy heuristic for the set covering problem. Math. Oper. Res.\u00a04, 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Dean, B., Goemans, M.X., Vondr\u00e1k, J.: Approximating the stochastic knapsack: the benefit of adaptivity. In: FOCS, pp. 208\u2013217 (2004)","DOI":"10.1109\/FOCS.2004.15"},{"key":"50_CR5","unstructured":"Dean, B., Goemans, M.X., Vondr\u00e1k, J.: Adaptivity and approximation for stochastic packing problems. In: SODA, pp. 395\u2013404 (2005)"},{"key":"50_CR6","unstructured":"Dean, B., Goemans, M.X., Vondr\u00e1k, J.: Approximating the stochastic knapsack: the benefit of adaptivity. Journal version (submitted, 2005)"},{"issue":"4","key":"50_CR7","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. JACM\u00a045(4), 634\u2013652 (1998)","journal-title":"JACM"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Gupta, A., P\u00e1l, M., Ravi, R., Sinha, A.: Boosted sampling: approximation algorithms for stochastic optimization. In: SODA, pp. 417\u2013426 (2004)","DOI":"10.1145\/1007352.1007419"},{"key":"50_CR9","series-title":"Lecture Notes in Computer Science","first-page":"86","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"A. Gupta","year":"2005","unstructured":"Gupta, A., P\u00e1l, M., Ravi, R., Sinha, A.: What about wednesday? Approximation algorithms for multistage stochastic optimization. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol.\u00a03624, pp. 86\u201398. Springer, Heidelberg (2005)"},{"key":"50_CR10","unstructured":"Immorlica, N., Karger, D., Minkoff, M., Mirrokni, V.: On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In: SODA, pp. 184\u2013693 (2004)"},{"key":"50_CR11","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. Johnson","year":"1974","unstructured":"Johnson, D.: Approximation algorithms for combinatorial problems. J. Comp. Syst. Sci.\u00a09, 256\u2013276 (1974)","journal-title":"J. Comp. Syst. Sci."},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Kolliopoulos, S., Young, N.: Tight approximation results for general covering integer programs. In: FOCS, pp. 522\u2013531 (2001)","DOI":"10.1109\/SFCS.2001.959928"},{"key":"50_CR13","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of the optimal integral and fractional covers. Disc. Math.\u00a013, 256\u2013278 (1975)","journal-title":"Disc. Math."},{"key":"50_CR14","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","volume":"37","author":"P. Raghavan","year":"1988","unstructured":"Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comp. and System Sci.\u00a037, 130\u2013143 (1988)","journal-title":"J. Comp. and System Sci."},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"Shmoys, D., Swamy, C.: Stochastic optimization is (almost) as easy as deterministic optimization. In: FOCS, pp. 228\u2013237 (2004)","DOI":"10.1109\/FOCS.2004.62"},{"key":"50_CR16","unstructured":"Shmoys, D., Swamy, C.: Sampling-based approximation algorithms for multistage stochastic optimization. In: FOCS, pp. 357\u2013366 (2005)"},{"key":"50_CR17","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: Improved approximations of packing and covering problems. In: STOC, pp. 268\u2013276 (1995)","DOI":"10.1145\/225058.225138"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T20:07:57Z","timestamp":1736280477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11682462_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}