{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T23:04:55Z","timestamp":1694041495378},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,11,19]],"date-time":"2011-11-19T00:00:00Z","timestamp":1321660800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s00453-011-9596-0","type":"journal-article","created":{"date-parts":[[2011,11,18]],"date-time":"2011-11-18T15:48:23Z","timestamp":1321631303000},"page":"391-408","source":"Crossref","is-referenced-by-count":11,"title":["Two-stage Robust Network Design with Exponential Scenarios"],"prefix":"10.1007","volume":"65","author":[{"given":"Rohit","family":"Khandekar","sequence":"first","affiliation":[]},{"given":"Guy","family":"Kortsarz","sequence":"additional","affiliation":[]},{"given":"Vahab","family":"Mirrokni","sequence":"additional","affiliation":[]},{"given":"Mohammad R.","family":"Salavatipour","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,19]]},"reference":[{"key":"9596_CR1","first-page":"583","volume-title":"Proceedings of the 42nd ACM Symposium on Theory of Computing","author":"J. Byrka","year":"2010","unstructured":"Byrka, J., Grandoni, F., Thomas, R., Laura, S.: An improved LP-based approximation for steiner tree. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp.\u00a0583\u2013592 (2010)"},{"key":"9596_CR2","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1109\/SFCS.2005.42","volume-title":"Proc. of 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201905)","author":"K. Dhamdhere","year":"2005","unstructured":"Dhamdhere, K., Goyal, V., Ravi, R., Singh, M.: How to pay, come what may: approximation algorithms for demand-robust covering problems. In: Proc. of 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201905), pp.\u00a0367\u2013378 (2005)"},{"key":"9596_CR3","doi-asserted-by":"crossref","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. Manag. Sci. 1, 197\u2013206 (1955)","journal-title":"Manag. Sci."},{"key":"9596_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/978-3-540-72792-7_33","volume-title":"Proc. of the 12th International Integer Programming and Combinatorial Optimization Conference","author":"U. Feige","year":"2007","unstructured":"Feige, U., Jain, K., Mahdian, M., Mirrokni, V.: Robust combinatorial optimization with exponential scenarios. In: Proc. of the 12th International Integer Programming and Combinatorial Optimization Conference. Lecture Notes in Computer Science, vol.\u00a04513, pp.\u00a0439\u2013453 (2007)"},{"issue":"4","key":"9596_CR5","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E. Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D., Papadimitriou, C., Seymour, P., Yannakakis, M.: The complexity of multiterminal Cuts. SIAM J. Comput. 23(4), 864\u2013894 (1994)","journal-title":"SIAM J. Comput."},{"key":"9596_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/11672142_16","volume-title":"Proc. of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS)","author":"D. Golovin","year":"2006","unstructured":"Golovin, D., Goyal, V., Ravi, R.: Pay today for a rainy day: improved approximation algorithms for demand-robust min-cut and shortest path problems. In: Proc. of the 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science, vol.\u00a03884, pp.\u00a0206\u2013217 (2006)"},{"key":"9596_CR7","first-page":"86","volume-title":"Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing (STOC)","author":"A. Gupta","year":"2004","unstructured":"Gupta, A., P\u00e1l, M., Ravi, R., Sinha, A.: Boosted sampling: approximation algorithms for stochastic optimization. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing (STOC), pp.\u00a086\u201398 (2004)"},{"key":"9596_CR8","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/FOCS.2004.11","volume-title":"Proc. of 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"A. Gupta","year":"2004","unstructured":"Gupta, A., Ravi, R., Sinha, A.: An edge in time saves nine: LP rounding approximation algorithms for stochastic network design. In: Proc. of 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a0218\u2013227 (2004)"},{"key":"9596_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/978-3-642-14165-2_23","volume-title":"Proc. of the 37th International Colloquium on Automata, Languages and Programming (ICALP)","author":"A. Gupta","year":"2010","unstructured":"Gupta, A., Nagarajan, V., Ravi, R.: Thresholded covering algorithms for robust and max-min optimization. In: Proc. of the 37th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol.\u00a06198, pp.\u00a0262\u2013274 (2010)"},{"key":"9596_CR10","first-page":"691","volume-title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"N. Immorlica","year":"2004","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 Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0691\u2013700 (2004)"},{"key":"9596_CR11","volume-title":"Decision Processes","author":"J.W. Milnor","year":"1954","unstructured":"Milnor, J.W.: Games against nature. In: Thrall, R.M., Coomb, C.H., Davis, R.L. (eds.) Decision Processes. Wiley, New York (1954)"},{"issue":"1","key":"9596_CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10107-005-0673-5","volume":"108","author":"R. Ravi","year":"2006","unstructured":"Ravi, R., Sinha, A.: Hedging uncertainty: Approximation algorithms for stochastic optimization problems. Math. Program. 108(1), 97\u2013114 (2006)","journal-title":"Math. Program."},{"key":"9596_CR13","first-page":"770","volume-title":"Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"G. Robins","year":"2000","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0770\u2013779 (2000)"},{"key":"9596_CR14","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1109\/FOCS.2004.62","volume-title":"Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"D. Shmoys","year":"2004","unstructured":"Shmoys, D., Swamy, C.: Stochastic optimization is (almost) as easy as deterministic optimization. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a0228\u2013237 (2004)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9596-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9596-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9596-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:08Z","timestamp":1559137508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9596-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,19]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["9596"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9596-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,19]]}}}