{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:10:52Z","timestamp":1725567052727},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_38","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"369-379","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for Terminal Steiner Trees"],"prefix":"10.1007","author":[{"given":"F\u00e1bio","family":"Viduani Martinez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Coelho de Pina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Soares","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","volume":"32","author":"M. Bern","year":"1989","unstructured":"Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Information Processing Letters\u00a032, 171\u2013176 (1989)","journal-title":"Information Processing Letters"},{"key":"38_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-45071-8_14","volume-title":"Computing and Combinatorics","author":"Y.H. Chen","year":"2003","unstructured":"Chen, Y.H., Lu, C.L., Tang, C.Y.: On the full and bottleneck full Steiner tree problems. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 122\u2013129. Springer, Heidelberg (2003)"},{"issue":"1","key":"38_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ipl.2003.09.014","volume":"89","author":"D.E. Drake","year":"2004","unstructured":"Drake, D.E., Hougardy, S.: On approximation algorithms for the terminal Steiner tree problem. Information Processing Letters\u00a089(1), 15\u201318 (2004)","journal-title":"Information Processing Letters"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0020-0190(03)00285-0","volume":"87","author":"B. Fuchs","year":"2003","unstructured":"Fuchs, B.: A note on the terminal Steiner tree problem. Information Processing Letters\u00a087, 219\u2013220 (2003)","journal-title":"Information Processing Letters"},{"issue":"1","key":"38_CR5","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"C.A.J. Hurkens","year":"1989","unstructured":"Hurkens, C.A.J., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM Journal of Discrete Mathematics\u00a02(1), 68\u201372 (1989)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0020-0190(02)00227-2","volume":"84","author":"G. Lin","year":"2002","unstructured":"Lin, G., Xue, G.: On the terminal Steiner tree problem. Information Processing Letters\u00a084, 103\u2013107 (2002)","journal-title":"Information Processing Letters"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0304-3975(03)00209-3","volume":"306","author":"C.L. Lu","year":"2003","unstructured":"Lu, C.L., Tang, C.Y., Lee, R.C.-T.: The full Steiner tree problem. Theoretical Computer Science\u00a0306, 55\u201367 (2003)","journal-title":"Theoretical Computer Science"},{"key":"38_CR8","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, California, USA, January 2000, pp. 770\u2013779 (2000)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T04:06:01Z","timestamp":1553141161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11533719_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}