{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T03:49:56Z","timestamp":1754020196133,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540548911"},{"type":"electronic","value":"9783540464594"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54891-2_8","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:17:07Z","timestamp":1330211827000},"page":"103-111","source":"Crossref","is-referenced-by-count":7,"title":["On shortest networks for classes of points in the plane"],"prefix":"10.1007","author":[{"given":"Edmund","family":"Ihler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriele","family":"Reich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"8_CR1","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M.R. Garey, D.S. Johnson: Computers and intractability: a guide to the theory of NP-completeness, Freeman, New York, 1979."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"J.-m. Ho, D.T. Lee, C.-H. Chang, C.K. Wong: Bounded-diameter minimum spanning trees and related problems, Symp. on Comp. Geometry, 1989, 276\u2013282.","DOI":"10.1145\/73833.73864"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"E. Ihler: Bounds on the quality of approximate solutions to the Group Steiner Problem, Graph-Theoretic concepts in Computer Science, WG90, Lecture Notes in Computer Science, Springer, 1991.","DOI":"10.1007\/3-540-53832-1_36"},{"key":"8_CR4","volume-title":"Tech. Report","author":"E. Ihler","year":"1991","unstructured":"E. Ihler: The complexity of approximating the class Steiner tree problem, Tech. Report, Institut f\u00fcr Informatik, Universit\u00e4t Freiburg, Germany, 1991."},{"key":"8_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: an introduction","author":"F. P. Preparata","year":"1985","unstructured":"F.P. Preparata, M.I. Shamos: Computational Geometry: an introduction, Springer, New York, 1985."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"G. Reich, P. Widmayer: Beyond Steiner's problem: a VLSI oriented generalization, Graph-Theoretic concepts in Computer Science, WG89, Lecture Notes in Computer Science, Vol. 411, Springer, 1990, 196\u2013210.","DOI":"10.1007\/3-540-52292-1_14"}],"container-title":["Lecture Notes in Computer Science","Computational Geometry-Methods, Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54891-2_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:24:44Z","timestamp":1742592284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54891-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540548911","9783540464594"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-54891-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}