{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:10:43Z","timestamp":1743055843825,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_35","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"445-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Rectilinear Steiner Tree Problem with Given Topology and Length Restrictions"],"prefix":"10.1007","author":[{"given":"Jens","family":"Ma\u00dfberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"issue":"24","key":"35_CR1","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1016\/j.ipl.2010.08.016","volume":"110","author":"C Bartoschek","year":"2010","unstructured":"Bartoschek, C., Held, S., Ma\u00dfberg, J., Rautenbach, D., Vygen, J.: The repeater tree construction problem. Information Processing Letters 110(24), 1079\u20131083 (2010)","journal-title":"Information Processing Letters"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Victor Cabot, A., Francis, R.L., Stary, M.A.: A network flow solution to a rectilinear distance facility location problem. AIIE Transactions 2(2) 132\u2013141 (1970)","DOI":"10.1080\/05695557008974743"},{"key":"35_CR3","unstructured":"Edmonds, J.: Submodular functions, matroids and certain polyhedra. In: Gordon, Breach (eds.) Combinatorial Structures and Their Applications, New York, pp. 68\u201387 (1970)"},{"issue":"4","key":"35_CR4","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM Journal on Applied Mathematics 32(4), 826\u2013834 (1977)","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"2","key":"35_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1137\/0114025","volume":"14","author":"M Hanan","year":"1966","unstructured":"Hanan, M.: On Steiner\u2019s problem with rectilinear distance. SIAM Journal on Applied Mathematics 14(2), 255\u2013265 (1966)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Jiang, T., Wang, L.: Computing shortest networks with fixed topologies. Advances in Steiner Trees. vol. 6. Combinatorial Optimization, pp. 39\u201362. Springer, US (2000)","DOI":"10.1007\/978-1-4757-3171-2_4"},{"issue":"2\u20133","key":"35_CR7","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0166-218X(99)00111-0","volume":"93","author":"G Kortsarz","year":"1999","unstructured":"Kortsarz, G., Peleg, D.: Approximating the weight of shallow Steiner trees. Discrete Applied Mathematics 93(2\u20133), 265\u2013285 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Rao, S.K., Sadayappan, P., Hwang, F.K., Shor, P.W.: The rectilinear Steiner arborescence problem. Algorithmica 7(1\u20136), 277\u2013288 (1992)","DOI":"10.1007\/BF01758762"},{"issue":"3","key":"35_CR9","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1137\/S0097539704371353","volume":"35","author":"W Shi","year":"2005","unstructured":"Shi, W., Chen, S.: The rectilinear Steiner arborescence problem is NP-complete. SIAM Journal on Computation 35(3), 729\u2013740 (2005)","journal-title":"SIAM Journal on Computation"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:32:12Z","timestamp":1674567132000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}