{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:51:23Z","timestamp":1758268283730,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"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\/11672142_16","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T08:27:54Z","timestamp":1141115274000},"page":"206-217","source":"Crossref","is-referenced-by-count":13,"title":["Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Golovin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vineet","family":"Goyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D. Bertsimas","year":"2003","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Mathematical Programming Series B\u00a098, 49\u201371 (2003)","journal-title":"Mathematical Programming Series B"},{"issue":"2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D. Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Operation Research\u00a052(2), 35\u201353 (2004)","journal-title":"Operation Research"},{"key":"16_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":"16_CR4","doi-asserted-by":"crossref","unstructured":"Dhamdhere, K., Goyal, V., Ravi, R., Singh, M.: How to pay, come what may: Approximation algorithms for demand-robust covering problems. In: FOCS, pp. 367\u2013378 (2005)","DOI":"10.1109\/SFCS.2005.42"},{"key":"16_CR5","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)"},{"issue":"4","key":"16_CR6","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM\u00a035(4), 921\u2013940 (1988)","journal-title":"J. ACM"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Gupta, A., P\u00e1l, M., Ravi, R., Sinha, A.: Boosted sampling: approximation algorithms for stochastic optimization. In: STOC, pp. 417\u2013426 (2004)","DOI":"10.1145\/1007352.1007419"},{"key":"16_CR8","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: FOCS, pp. 218\u2013227 (2004)","DOI":"10.1109\/FOCS.2004.11"},{"key":"16_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: SODA, pp. 684\u2013693 (2004)"},{"issue":"2","key":"16_CR10","first-page":"241","volume":"22","author":"N. Philip","year":"1997","unstructured":"Philip, N., Klein, S.A.: Plotkin, Satish Rao, and Eva Tardos. Approximation algorithms for steiner and directed multicuts\u00a022(2), 241\u2013269 (1997)","journal-title":"Approximation algorithms for steiner and directed multicuts"},{"key":"16_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust Discrete Optimisation and Its Applications","author":"P. Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust Discrete Optimisation and Its Applications. Kluwer Academic Publishers, Netherlands (1997)"},{"key":"16_CR12","volume-title":"Games and Decision","author":"R.D. Luce","year":"1957","unstructured":"Luce, R.D., Raiffa, H.: Games and Decision. Wiley, New York (1957)"},{"key":"16_CR13","volume-title":"Decision Processes","author":"J.W. Milnor","year":"1954","unstructured":"Milnor, J.W.: Games against nature. In: Thrall, R.M., Coombs, C.H., Davis, R.L. (eds.) Decision Processes, Wiley, New York (1954)"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1287\/opre.43.2.264","volume":"43","author":"J.M. Mulvey","year":"1995","unstructured":"Mulvey, J.M., Vanderbei, R.J., Zenios, S.J.: Robust optimization of large-scale systems. Operations Research\u00a043, 264\u2013281 (1995)","journal-title":"Operations Research"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Nagarajan, V., Ravi, R.: Approximation algorithms for requirement cut on graphs. In: APPROX + RANDOM, pp. 209\u2013220 (2005)","DOI":"10.1007\/11538462_18"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Nikulin, Y.: Robustness in combinatorial optimization and scheduling theory: An annotated bibliography (2004), http:\/\/www.optimization-online.org\/DB_FILE\/2004\/11\/995.pdf","DOI":"10.1007\/978-3-540-24804-0_2"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Ravi, R., Sinha, A.: Hedging uncertainty: Approximation algorithms for stochastic optimization problems. In: IPCO, pp. 101\u2013115 (2004)","DOI":"10.1007\/978-3-540-25960-2_8"},{"key":"16_CR18","unstructured":"Robins, G., Zelikovsky, A.: Improved steiner tree approximation in graphs. In: SODA, pp. 770\u2013779 (2000)"},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1080\/00207548708919855","volume":"25","author":"M.J. Rosenblatt","year":"1987","unstructured":"Rosenblatt, M.J., Lee, H.L.: A robustness approach to facilities design. International Journal of Production Research\u00a025, 479\u2013486 (1987)","journal-title":"International Journal of Production Research"},{"key":"16_CR20","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"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T21:55:23Z","timestamp":1736286923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11672142_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}