{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:59:19Z","timestamp":1725893959255},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735557"},{"type":"electronic","value":"9783540735564"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73556-4_14","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T11:55:47Z","timestamp":1188302147000},"page":"112-123","source":"Crossref","is-referenced-by-count":4,"title":["Steiner Forests on Stochastic Metric Graphs"],"prefix":"10.1007","author":[{"given":"Vangelis Th.","family":"Paschos","sequence":"first","affiliation":[]},{"given":"Orestis A.","family":"Telelis","sequence":"additional","affiliation":[]},{"given":"Vassilis","family":"Zissimopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1137\/S0097539792236237","volume":"24","author":"A. Agrawal","year":"1995","unstructured":"Agrawal, A., Klein, P.N., Ravi, R.: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks. SIAM Journal on Computing\u00a024(3), 440\u2013456 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR2","unstructured":"Bertsimas, D.: Probabilistic Combinatorial Optimization. PhD thesis (1988)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/net.3230200302","volume":"20","author":"D. Bertsimas","year":"1990","unstructured":"Bertsimas, D.: The probabilistic minimum spanning tree problem. Networks\u00a020, 245\u2013275 (1990)","journal-title":"Networks"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Introduction to Stochastic Programming","author":"J.R. Birge","year":"1997","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. LNCS. Springer, Heidelberg (1997)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1287\/mnsc.1.3-4.197","volume":"1","author":"G.W. Dantzig","year":"1951","unstructured":"Dantzig, G.W.: Linear programming under uncertainty. Management Science\u00a01, 197\u2013206 (1951)","journal-title":"Management Science"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/11496915_24","volume-title":"IPCO 2005","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)"},{"key":"14_CR7","first-page":"663","volume-title":"Proceedings of the ACM Symposium on Theory of Computing (STOC)","author":"L. Fleischer","year":"2006","unstructured":"Fleischer, L., Koenemann, J., Leonardi, S., Schaefer, G.: Simple cost sharing schemes for multicommodity rent-or-buy and stochastic steiner tree. In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 663\u2013670. ACM Press, New York (2006)"},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A General Approximation Technique for Constrained Forest Problems. SIAM Journal on Computing\u00a024(2), 296\u2013317 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1007\/11523468_85","volume-title":"Automata, Languages and Programming","author":"A. Gupta","year":"2005","unstructured":"Gupta, A., P\u00e1l, M.: Stochastic Steiner Trees Without a Root. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1051\u20131063. Springer, Heidelberg (2005)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Gupta, A., P\u00e1l, M., Ravi, R., Sinha, A.: What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization. In: Proceedings of the International Workshop on Approximation and Randomized Algorithms (APPROX-RANDOM), pp. 86\u201398 (2005)","DOI":"10.1007\/11538462_8"},{"key":"14_CR11","first-page":"417","volume-title":"Proceedings of the 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: Gupta, A. (ed.) Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 417\u2013426. ACM Press, New York (2004)"},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/FOCS.2004.11","volume-title":"Proceedings of the 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: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pp. 218\u2013227. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"14_CR13","first-page":"691","volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"N. Immorlica","year":"2004","unstructured":"Immorlica, N., Karger, D.R., Minkoff, M., Mirrokni, V.S.: On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 691\u2013700. ACM Press, New York (2004)"},{"key":"14_CR14","unstructured":"Jaillet, P.: Probabilistic Traveling Salesman Problems. PhD thesis (1985)"},{"issue":"3","key":"14_CR15","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199905)33:3<207::AID-NET7>3.0.CO;2-7","volume":"33","author":"C. Murat","year":"1999","unstructured":"Murat, C., Paschos, V.Th.: The probabilistic longest path problem. Networks\u00a033(3), 207\u2013219 (1999)","journal-title":"Networks"},{"issue":"1\u20132","key":"14_CR16","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/S0304-3975(01)00005-6","volume":"270","author":"C. Murat","year":"2002","unstructured":"Murat, C., Paschos, V.Th.: A priori optimization for the probabilistic maximum independent set problem. Theoretical Computer Science\u00a0270(1\u20132), 561\u2013590 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.dam.2005.06.007","volume":"154","author":"C. Murat","year":"2006","unstructured":"Murat, C., Paschos, V.Th.: On the probabilistic minimum coloring and minimum k-coloring. Discrete Applied Mathematics\u00a0154(3), 564\u2013586 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2003","unstructured":"Vazirani, V.: Approximation Algorithms. LNCS. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73556-4_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:51:37Z","timestamp":1619502697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73556-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735557","9783540735564"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73556-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}