{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:30:23Z","timestamp":1725899423811},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360442"},{"type":"electronic","value":"9783642360466"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36046-6_14","type":"book-chapter","created":{"date-parts":[[2013,1,16]],"date-time":"2013-01-16T00:56:22Z","timestamp":1358297782000},"page":"143-154","source":"Crossref","is-referenced-by-count":3,"title":["Parameterized Algorithms for Stochastic Steiner Tree Problems"],"prefix":"10.1007","author":[{"given":"Denis","family":"Kurz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Zey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","volume":"32","author":"M.W. Bern","year":"1989","unstructured":"Bern, M.W., Plassmann, P.E.: The Steiner problem with edge lengths 1 and 2. Information Processing Letters\u00a032(4), 171\u2013176 (1989)","journal-title":"Information Processing Letters"},{"key":"14_CR2","volume-title":"Introduction to Stochastic Programming","author":"J.R. Birge","year":"1997","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, New York (1997)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets M\u00f6bius: Fast subset convolution. In: STOC, pp. 67\u201374. ACM (2007)","DOI":"10.1145\/1250790.1250801"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-17517-6_38","volume-title":"Algorithms and Computation","author":"I. Bomze","year":"2010","unstructured":"Bomze, I., Chimani, M., J\u00fcnger, M., Ljubi\u0107, I., Mutzel, P., Zey, B.: Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part I. LNCS, vol.\u00a06506, pp. 427\u2013439. Springer, Heidelberg (2010)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e1, L.: An improved LP-based approximation for Steiner tree. In: STOC, pp. 583\u2013592. ACM (2010)","DOI":"10.1145\/1806689.1806769"},{"key":"14_CR6","unstructured":"Charikar, M., Chekuri, C., Cheung, T., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problems. In: SODA, pp. 192\u2013200. SIAM (1998)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-25011-8_30","volume-title":"Combinatorial Algorithms","author":"M. Chimani","year":"2011","unstructured":"Chimani, M., Mutzel, P., Zey, B.: Improved Steiner Tree Algorithms for Bounded Treewidth. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol.\u00a07056, pp. 374\u2013386. Springer, Heidelberg (2011)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks\u00a01(3), 195\u2013207 (1971)","journal-title":"Networks"},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s00224-007-1324-4","volume":"41","author":"B. Fuchs","year":"2007","unstructured":"Fuchs, B., Kern, W., M\u00f6lle, D., Richter, S., Rossmanith, P., Wang, X.: Dynamic programming for minimum Steiner trees. Theory Computing Systems\u00a041(3), 493\u2013500 (2007)","journal-title":"Theory Computing Systems"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-74208-1_10","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Gupta","year":"2007","unstructured":"Gupta, A., Hajiaghayi, M.T., Kumar, A.: Stochastic Steiner Tree with Non-uniform Inflation. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX\/RANDOM 2007. LNCS, vol.\u00a04627, pp. 134\u2013148. Springer, Heidelberg (2007)"},{"key":"14_CR12","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. ACM (2004)","DOI":"10.1145\/1007352.1007419"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: STOC, pp. 585\u2013594. ACM (2003)","DOI":"10.1145\/780542.780628"},{"key":"14_CR14","unstructured":"Hwang, F., Richards, D., Winter, P.: The Steiner tree problem. Annals of discrete mathematics, vol.\u00a053. North-Holland (1992)"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Kahng, A.B., Robins, G.: On Optimal Interconnections for VLSI. Kluwer Academic Publishers (1995)","DOI":"10.1007\/978-1-4757-2363-2"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103. Plenum (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"14_CR17","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Habilitation, Universit\u00e4t T\u00fcbingen (2002)"},{"key":"14_CR18","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications (1998)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/11944836_3","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"C. Swamy","year":"2006","unstructured":"Swamy, C., Shmoys, D.B.: Approximation Algorithms for 2-Stage Stochastic Optimization Problems. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 5\u201319. Springer, Heidelberg (2006)"},{"issue":"1","key":"14_CR20","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1002\/net.10035","volume":"40","author":"E. Uchoa","year":"2002","unstructured":"Uchoa, E., de Arag\u00e3o, M.P., Ribeiro, C.C.: Preprocessing Steiner problems from VLSI layout. Networks\u00a040(1), 38\u201350 (2002)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Mathematical and Engineering Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36046-6_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:34:45Z","timestamp":1620135285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36046-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360442","9783642360466"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36046-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}