{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:36:04Z","timestamp":1742387764152},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540538325"},{"type":"electronic","value":"9783540463108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-53832-1_36","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:13:13Z","timestamp":1330207993000},"page":"109-118","source":"Crossref","is-referenced-by-count":18,"title":["Bounds on the quality of approximate solutions to the group Steiner problem"],"prefix":"10.1007","author":[{"given":"Edmund","family":"Ihler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S. E. Dreyfus","year":"1971","unstructured":"S. E. Dreyfus, R. A. Wagner: The Steiner Problem in Graphs, Networks, Vol. 1, 1971, 195\u2013207.","journal-title":"Networks"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. L. Fredman","year":"1987","unstructured":"M. L. Fredman, R. E. Tarjan: Fibonacci Heaps and Their Uses in Improved Networks Optimization Algorithms, Journal of the ACM, Vol. 34, 1987, 596\u2013615.","journal-title":"Journal of the ACM"},{"key":"10_CR3","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":"10_CR4","first-page":"85","volume-title":"Reducibility among Combinatorial Problems","author":"R. M. Karp","year":"1972","unstructured":"R. M. Karp: Reducibility among Combinatorial Problems, Complexity of Computer Computations, New York, 1972, 85\u2013103."},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L. Kou","year":"1981","unstructured":"L. Kou, G. Markowsky, L. Berman: A Fast Algorithm for Steiner Trees, Acta Informatica, Vol. 15, 1981, 141\u2013145.","journal-title":"Acta Informatica"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K. Mehlhorn","year":"1988","unstructured":"K. Mehlhorn: A Faster Approximation Algorithm for the Steiner Problem in Graphs, Information Processing Letters, Vol. 27, 1988, 125\u2013128.","journal-title":"Information Processing Letters"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"G. Reich, P. Widmayer: Beyond Steiner's problem: A VLSI oriented generalization, 15th International Workshop on Graph-Theoretic Concepts in Computer Science, Castle Rolduc, 1989.","DOI":"10.1007\/3-540-52292-1_14"},{"key":"10_CR8","unstructured":"G. Reich, P. Widmayer: Approximate Minimum Spanning Trees for Vertex Classes, Technical Report, Institut f\u00fcr Informatik, Universit\u00e4t Freiburg, Rheinstra\u00dfe 10\u201312, 7800 Freiburg, West Germany"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53832-1_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:50:58Z","timestamp":1605646258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53832-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540538325","9783540463108"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-53832-1_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}