{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:42:43Z","timestamp":1742982163616,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":14,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_403","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:30:58Z","timestamp":1214505058000},"page":"900-904","source":"Crossref","is-referenced-by-count":0,"title":["Steiner Trees"],"prefix":"10.1007","author":[{"given":"Yaocun","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"403_CR1_403","doi-asserted-by":"crossref","unstructured":"Arora, S.: Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. Proc. 37th IEEE Symp. on Foundations of Computer Science, pp. 2\u201312 (1996)","DOI":"10.1109\/SFCS.1996.548458"},{"key":"403_CR2_403","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1006\/jagm.1994.1041","volume":"17","author":"P. Berman","year":"1994","unstructured":"Berman, P., Ramaiyer, V.: Improved approximations for the Steiner tree problem. J.\u00a0Algorithms 17, 381\u2013408 (1994)","journal-title":"J. Algorithms"},{"key":"403_CR3_403","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\u00a01 and\u00a02. Inf. Proc. Lett. 32, 171\u2013176 (1989)","journal-title":"Inf. Proc. Lett."},{"key":"403_CR4_403","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1145\/321724.321733","volume":"19","author":"S.K. Chang","year":"1972","unstructured":"Chang, S.K.: The generation of minimal trees with a\u00a0Steiner topology. J.\u00a0ACM 19, 699\u2013711 (1972)","journal-title":"J. ACM"},{"key":"403_CR5_403","unstructured":"Chang, S.K.: The design of network configurations with linear or piecewise linear cost functions. In: Symp. on Computer-Communications, Networks, and Teletraffic, pp.\u00a0363\u2013369 IEEE Computer Society Press, California (1972)"},{"key":"403_CR6_403","unstructured":"Crourant, R., Robbins, H.: What Is Mathematics? Oxford University Press, New York (1941)"},{"key":"403_CR7_403","doi-asserted-by":"publisher","first-page":"9464","DOI":"10.1073\/pnas.87.23.9464","volume":"87","author":"D.Z. Du","year":"1990","unstructured":"Du, D.Z., Hwang, F.K.: The Steiner ratio conjecture of Gilbert-Pollak is true. Proc. Natl. Acad. Sci. USA 87, 9464\u20139466 (1990)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"403_CR8_403","unstructured":"Du, D.Z., Zhang, Y., Feng, Q.: On better heuristic for euclidean Steiner minimum trees. In: Proceedings 32nd FOCS, IEEE Computer Society Press, California (1991)"},{"key":"403_CR9_403","first-page":"167","volume-title":"Proceedings of 19th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"D.Z. Du","year":"2008","unstructured":"Du, D.Z., Graham, R.L., Pardalos, P.M., Wan, P.J., Wu, W., Zhao, W.: Analysis of greedy approximations with nonsubmodular potential functions. In: Proceedings of 19th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0167\u2013175. ACM, New York (2008)"},{"key":"403_CR10_403","doi-asserted-by":"crossref","unstructured":"Kahng, A., Robins, G.: A\u00a0new family of Steiner tree heuristics with good performance: the iterated 1-Steiner approach. In: Proceedings of IEEE Int. Conf. on Computer-Aided Design, Santa Clara, pp.428\u2013431 (1990)","DOI":"10.1109\/ICCAD.1990.129944"},{"key":"403_CR11_403","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"L.A. Wolsey","year":"1982","unstructured":"Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2, 385\u2013393 (1982)","journal-title":"Combinatorica"},{"key":"403_CR12_403","unstructured":"Robin, G., Zelikovsky, A.: Improved Steiner trees approximation in graphs. In: SIAM-ACM Symposium on Discrete Algorithms (SODA), San Francisco, CA, pp. 770\u2013779. January (2000)"},{"key":"403_CR13_403","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/net.3230110104","volume":"11","author":"J.M. Smith","year":"1981","unstructured":"Smith, J.M., Lee, D.T., Liebman, J.S.: An O(N\u202flog\u202fN) heuristic for Steiner minimal tree problems in the Euclidean metric. Networks 11, 23\u201339 (1981)","journal-title":"Networks"},{"key":"403_CR14_403","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF01187035","volume":"9","author":"A.Z. Zelikovsky","year":"1993","unstructured":"Zelikovsky, A.Z.: The 11\/6-approximation algorithm for the Steiner problem on networks. Algorithmica 9, 463\u2013470 (1993)","journal-title":"Algorithmica"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:32:15Z","timestamp":1738272735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_403"}},"subtitle":["2006; Du, Graham, Pardalos, Wan, Wu, Zhao"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_403","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}