{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:09Z","timestamp":1725544029648},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540345978"},{"type":"electronic","value":"9783540345985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11764298_22","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T08:37:56Z","timestamp":1148027876000},"page":"241-252","source":"Crossref","is-referenced-by-count":8,"title":["Practical Partitioning-Based Methods for the Steiner Problem"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Polzin","sequence":"first","affiliation":[]},{"given":"Siavash Vahdati","family":"Daneshmand","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","first-page":"1","volume":"11","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica\u00a011, 1\u201321 (1993)","journal-title":"Acta Cybernetica"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR3","series-title":"Combinatorial Optimization","volume-title":"Steiner Trees in Industry","year":"2001","unstructured":"Cheng, X., Du, D.-Z. (eds.): Steiner Trees in Industry. Combinatorial Optimization, vol.\u00a011. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"22_CR4","first-page":"173","volume-title":"Advances in Steiner Trees","author":"C.W. Duin","year":"2000","unstructured":"Duin, C.W.: Preprocessing the Steiner problem in graphs. In: Du, D., Smith, J., Rubinstein, J. (eds.) Advances in Steiner Trees, pp. 173\u2013233. Kluwer, Dordrecht (2000)"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1006\/jagm.1999.1055","volume":"34","author":"M.R. Henzinger","year":"2000","unstructured":"Henzinger, M.R., Rao, S., Gabow, H.N.: Computing vertex connectivity: New bounds from old techniques. J. Algorithms\u00a034(2), 222\u2013250 (2000)","journal-title":"J. Algorithms"},{"key":"22_CR6","series-title":"Annals of Discrete Mathematics","volume-title":"The Steiner Tree Problem","author":"F.K. Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Annals of Discrete Mathematics, vol.\u00a053. North-Holland, Amsterdam (1992)"},{"key":"22_CR7","unstructured":"Koch, T., Martin, A.: SteinLib (2001), \n                    \n                      http:\/\/elib.zib.de\/steinlib"},{"key":"22_CR8","unstructured":"Korach, E., Solel, N.: Linear time algorithm for minimum weight Steiner tree in graphs with bounded tree-width. Technical Report 632, Technicon - Israel Institute of Technology, Computer Science Department, Haifa, Israel (1990)"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0166-218X(00)00319-X","volume":"112","author":"T. Polzin","year":"2001","unstructured":"Polzin, T., Vahdati Daneshmand, S.: Improved algorithms for the Steiner problem in networks. Discrete Applied Mathematics\u00a0112, 263\u2013300 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/3-540-45749-6_69","volume-title":"Algorithms - ESA 2002","author":"T. Polzin","year":"2002","unstructured":"Polzin, T., Vahdati Daneshmand, S.: Extending reduction techniques for the Steiner tree problem. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 795\u2013807. Springer, Heidelberg (2002)"},{"key":"22_CR11","unstructured":"P\u00f6nitz, A., Tittmann, P.: Computing network reliability in graphs of restricted pathwidth. Technical report, Hochschule Mittweida (2001)"},{"key":"22_CR12","unstructured":"R\u00f6hrig, H.: Tree decomposition: A feasibility study. Master\u2019s thesis, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken (1998)"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/net.3230250206","volume":"25","author":"J.S. Salowe","year":"1995","unstructured":"Salowe, J.S., Warme, D.M.: Thirty-five point rectilinear Steiner minimal trees in a day. Networks\u00a025, 69\u201387 (1995)","journal-title":"Networks"},{"key":"22_CR14","unstructured":"Schakel, L.P.: Personal communication, Faculty of Economics, University of Groningen (2005), \n                    \n                      http:\/\/www.lofar.org\/"},{"key":"22_CR15","unstructured":"Vahdati Daneshmand, S.: Algorithmic Approaches to the Steiner Problem in Networks. PhD thesis, University of Mannheim (2004), \n                    \n                      http:\/\/bibserv7.bib.uni-mannheim.de\/madoc\/volltexte\/2004\/176"},{"key":"22_CR16","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-1-4757-3171-2_6","volume-title":"Advances in Steiner Trees","author":"D.M. Warme","year":"2000","unstructured":"Warme, D.M., Winter, P., Zachariasen, M.: Exact algorithms for plane Steiner tree problems: A computational study. In: Du, D.-Z., Smith, J.M., Rubinstein, J.H. (eds.) Advances in Steiner Trees, pp. 81\u2013116. Kluwer, Dordrecht (2000)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11764298_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:10:54Z","timestamp":1619507454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11764298_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345978","9783540345985"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11764298_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}