{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:51:17Z","timestamp":1761486677503,"version":"3.41.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1023\/a:1008384012064","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T14:41:38Z","timestamp":1040568098000},"page":"17-33","source":"Crossref","is-referenced-by-count":112,"title":["Approximations for Steiner Trees with Minimum Number of Steiner Points"],"prefix":"10.1007","volume":"18","author":[{"given":"DONGHUI","family":"CHEN","sequence":"first","affiliation":[]},{"given":"DING-ZHU","family":"DU","sequence":"additional","affiliation":[]},{"given":"XIAO-DONG","family":"HU","sequence":"additional","affiliation":[]},{"given":"GUO-HUI","family":"LIN","sequence":"additional","affiliation":[]},{"given":"LUSHENG","family":"WANG","sequence":"additional","affiliation":[]},{"given":"GUOLIANG","family":"XUE","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"260984_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S. (1996), Polynomial time approximation schemes for Euclidean TSP and other geometric problems, Proceedings of 37th FOCS.","DOI":"10.1007\/3-540-63248-4_5"},{"key":"260984_CR2","doi-asserted-by":"crossref","unstructured":"Chiang, C., Sarrafzadeh, M. and Wong, C.K. (1990), A powerful global router: based on Steiner min-max tree, in Proc. ICCAD-89; also IEEE Transactions on Computer-Aided Design 19: 1318\u20131325.","DOI":"10.1109\/43.62776"},{"key":"260984_CR3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01758755","volume":"7","author":"D.-Z. Du","year":"1992","unstructured":"Du, D.-Z. and Hwang, F.K. (1992), A proof of Gilbert-Pollak's conjecture on the Steiner ratio, Algorithmica 7: 121-135.","journal-title":"Algorithmica"},{"key":"260984_CR4","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S. and Maass, W. (1985), Approximation schemes for covering and packing problems in image processing and VLSI, J. ACM 32: 130-136.","journal-title":"J. ACM"},{"key":"260984_CR5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"22","author":"F.K. Hwang","year":"1992","unstructured":"Hwang, F.K. and Richards, D.S. (1992), Steiner tree problems, Networks 22: 55-89.","journal-title":"Networks"},{"key":"260984_CR6","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"Garey, M.R. Graham, R.L. and Johnson, D.S. (1977), The complexity of computing Steiner minimal trees, SIAM Journal on Applied Mathematics 32: 835-859.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"260984_CR7","doi-asserted-by":"crossref","first-page":"2209","DOI":"10.1002\/j.1538-7305.1967.tb04250.x","volume":"9","author":"E.N. Gilbert","year":"1967","unstructured":"Gilbert, E.N. (1967), Minimum cost communication networks, Bell System Technical Journal 9: 2209-2227.","journal-title":"Bell System Technical Journal"},{"key":"260984_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"E.N. Gilbert","year":"1968","unstructured":"Gilbert, E.N. and Pollak, H.O. (1968), Steiner minimal trees, SIAM Journal on Applied Mathematics 16: 1-29.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"260984_CR9","unstructured":"Hwang, F.K., Richard, D. and Winter, P. (1992), The Steiner minimum tree problems, Annals of Discrete Mathematics, Vol. 53, North-Holland."},{"issue":"1","key":"260984_CR10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1023\/A:1009758919736","volume":"1","author":"M. Karpinski","year":"1997","unstructured":"Karpinski, M. and Zelikovsky, A. (1997), New approximation algorithms for the Steiner tree problems, Journal of Combinatorial Optimization 1(1): 47-65.","journal-title":"Journal of Combinatorial Optimization"},{"key":"260984_CR11","doi-asserted-by":"crossref","unstructured":"Li, C.-S., Tong, F.F., Georgiou, C.J. and Chen, M., Gain equalization in metropolitan and wide area optical networks using optical amplifiers, Proc. IEEE INFOCOM' 94, pp. 130-137, June 1994.","DOI":"10.1109\/INFCOM.1994.337624"},{"key":"260984_CR12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0020-0190(98)00201-4","volume":"69","author":"G.-H. Lin","year":"1999","unstructured":"Lin, G.-H. and Xue, G.L. (1999), Steiner tree problem with minimum number of Steiner points and bounded edge-length, Information Processing Letters 69: 53-57.","journal-title":"Information Processing Letters"},{"issue":"1","key":"260984_CR13","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1023\/A:1009711003807","volume":"1","author":"J.L. Rubinstein","year":"1997","unstructured":"Rubinstein, J.L. and Weng, J.F. (1997), Compression theorems and Steiner ratios on spheres, Journal of Combinatorial Optimization 1(1): 67-78.","journal-title":"Journal of Combinatorial Optimization"},{"key":"260984_CR14","doi-asserted-by":"crossref","unstructured":"Ramamurthy, B., Iness, J. and Mukherjee, B., Minimizing the number of optical amplifiers needed to support a multi-wavelength optical LAN\/MAN, Proc. IEEE INFO-COM' 97, pp. 261-268, April 1997.","DOI":"10.1109\/INFCOM.1997.635138"},{"key":"260984_CR15","first-page":"571","volume":"29","author":"J. Soukup","year":"1975","unstructured":"Soukup, J. (1975), On minimum cost network with nonlinear costs, SIAM Journal on Computing 29: 571-581.","journal-title":"SIAM Journal on Computing"},{"key":"260984_CR16","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/(SICI)1097-0037(199612)28:4<187::AID-NET3>3.0.CO;2-H","volume":"28","author":"L. Wang","year":"1996","unstructured":"Wang, L. and Jiang, T. (1996), An approximation scheme for some Steiner tree problems in the plane, Networks 28: 187-193.","journal-title":"Networks"},{"key":"260984_CR17","unstructured":"West, D.B. (1996), Introduction to Graph Theory, Prentice Hall."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008384012064.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008384012064\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008384012064.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:47:58Z","timestamp":1751366878000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008384012064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["260984"],"URL":"https:\/\/doi.org\/10.1023\/a:1008384012064","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}