{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:33Z","timestamp":1725516813010},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_56","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"568-576","source":"Crossref","is-referenced-by-count":0,"title":["(1\u2009+\u2009\u03c1)-Approximation for Selected-Internal Steiner Minimum Tree"],"prefix":"10.1007","author":[{"given":"Xianyue","family":"Li","sequence":"first","affiliation":[]},{"given":"Yaochun","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Feng","family":"Zou","sequence":"additional","affiliation":[]},{"given":"Donghyun","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"56_CR1","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1137\/S0097539795281086","volume":"26","author":"A. Borchers","year":"1997","unstructured":"Borchers, A., Du, D.Z.: The k-Steiner Ratio in Graphs. SIAM Journal on Computing\u00a026(3), 857\u2013869 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"56_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0255-1","volume-title":"Steiner Trees in Industry","author":"X. Cheng","year":"2001","unstructured":"Cheng, X., Du, D.Z.: Steiner Trees in Industry. Kluwer Academic Publishers, Dordrecht, Netherlands (2001)"},{"key":"56_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0166-218X(94)00045-F","volume":"60","author":"D.Z. Du","year":"1995","unstructured":"Du, D.Z.: On Component-Size Bounded Steiner Trees. Discrete Applied Mathematics\u00a060, 131\u2013140 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"56_CR4","volume-title":"Advance in Steriner Tree","author":"D.Z. Du","year":"2000","unstructured":"Du, D.Z., Smith, J.M., Rubinstein, J.H.: Advance in Steriner Tree. Kluwer Academic Publishers, Dordrecht, Netherlands (2000)"},{"key":"56_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0196-8858(82)80004-3","volume":"3","author":"L. Foulds","year":"1982","unstructured":"Foulds, L., Graham, R.: The Steiner Problem in Phylogeny is NP-complete. Advances in Applied Mathematics\u00a03, 43\u201349 (1982)","journal-title":"Advances in Applied Mathematics"},{"key":"56_CR6","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"M. Garey","year":"1997","unstructured":"Garey, M., Graham, R., Johnson, D.: The Complexity of Computing Steriner Minimal Tree. SIAM Journal on Applied Mathematics\u00a032, 835\u2013859 (1997)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"56_CR7","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M. Garey","year":"1977","unstructured":"Garey, M., Johnson, D.: The Rectilinear Steiner Problem is NP-complete. SIAM Journal on Applied Mathematics\u00a032, 826\u2013834 (1977)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"56_CR8","volume-title":"Fundamentals of Molecular Evolution","author":"D. Graur","year":"2000","unstructured":"Graur, D., Li, W.H.: Fundamentals of Molecular Evolution, 2nd edn. Sinauer Publishers, Sunderland, Massachusetts (2000)","edition":"2"},{"key":"56_CR9","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.tcs.2007.05.035","volume":"381","author":"S.Y. Hsieh","year":"2007","unstructured":"Hsieh, S.Y., Yang, S.C.: Approximating the Selected-Internal Steriner Tree. Theoretical Computer Science\u00a0381, 288\u2013291 (2007)","journal-title":"Theoretical Computer Science"},{"key":"56_CR10","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. North-Holland, Amsterdam (1992)"},{"key":"56_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2363-2","volume-title":"On Optimal Interconnections for VLSI","author":"A.B. Kahng","year":"1995","unstructured":"Kahng, A.B., Robins, G.: On Optimal Interconnections for VLSI. Kluwer Publishers, Dordrecht (1995)"},{"key":"56_CR12","volume-title":"Paths, Flows and VLSI-Layout","author":"B. Korte","year":"1990","unstructured":"Korte, B., Pr\u00f6mel, H.J., Steger, A.: Steiner Trees in VLSI-Layouts. In: Korte, et al. (eds.) Paths, Flows and VLSI-Layout. Springer, Heidelberg (1990)"},{"key":"56_CR13","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":"56_CR14","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner Tree Approximation in Graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 770\u2013779 (2000)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T14:46:18Z","timestamp":1684507578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}