{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:29Z","timestamp":1761611069113,"version":"build-2065373602"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4399,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00182-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:42:39Z","timestamp":1027629759000},"page":"83-99","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":49,"title":["Approximations for Steiner trees with minimum number of Steiner points"],"prefix":"10.1016","volume":"262","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":"78","reference":[{"doi-asserted-by":"crossref","unstructured":"S. Arora, Polynomial time approximation schemes for Euclidean TSP and other geometric problems, Proc. 37th FOCS, 1996.","key":"10.1016\/S0304-3975(00)00182-1_BIB1","DOI":"10.1007\/3-540-63248-4_5"},{"key":"10.1016\/S0304-3975(00)00182-1_BIB2","first-page":"1318","article-title":"A powerful global router: based on Steiner min-max tree","volume":"19","author":"Chiang","year":"1990","journal-title":"Proc. ICCAD-89; IEEE Trans. Comput. -Aided Design"},{"key":"10.1016\/S0304-3975(00)00182-1_BIB3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01758755","article-title":"A proof of Gilbert-Pollak's conjecture on the Steiner ratio","volume":"7","author":"Du","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(00)00182-1_BIB4","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","article-title":"Approximation schemes for covering and packing problems in image processing and VLSI","volume":"32","author":"Hochbaum","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00182-1_BIB5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","article-title":"Steiner tree problems","volume":"22","author":"Hwang","year":"1992","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(00)00182-1_BIB6","article-title":"The Steiner minimum tree problems","volume":"53","author":"Hwang","year":"1992","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0304-3975(00)00182-1_BIB7","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0132072","article-title":"The complexity of computing Steiner minimal trees","volume":"32","author":"Garey","year":"1997","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0304-3975(00)00182-1_BIB8","doi-asserted-by":"crossref","first-page":"2209","DOI":"10.1002\/j.1538-7305.1967.tb04250.x","article-title":"Minimum cost communication networks","volume":"9","author":"Gilbert","year":"1967","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0304-3975(00)00182-1_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","article-title":"Steiner minimal tree","volume":"16","author":"Gilbert","year":"1968","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"10.1016\/S0304-3975(00)00182-1_BIB10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1023\/A:1009758919736","article-title":"New approximation algorithms for the Steiner tree problems","volume":"1","author":"Karpinski","year":"1997","journal-title":"J. Combin. Optim."},{"unstructured":"C.-S. Li, F.F. Tong, C.J. Georgiou, M. Chen, Gain equalization in metropolitan and wide area optical networks using optical amplifiers, Proc. IEEE INFOCOM\u201994, June 1994, pp. 130\u2013137.","key":"10.1016\/S0304-3975(00)00182-1_BIB11"},{"key":"10.1016\/S0304-3975(00)00182-1_BIB12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0020-0190(98)00201-4","article-title":"Steiner tree problem with minimum number of Steiner points and bounded edge-length","volume":"69","author":"Lin","year":"1999","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/S0304-3975(00)00182-1_BIB13","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1023\/A:1009711003807","article-title":"Compression theorems and Steiner ratios on spheres","volume":"1","author":"Rubinstein","year":"1997","journal-title":"J. Combin. Optim."},{"doi-asserted-by":"crossref","unstructured":"B. Ramamurthy, J. Iness, B. Mukherjee, Minimizing the number of optical amplifiers needed to support a multi-wavelength optical LAN\/MAN, Proc. IEEE INFOCOM\u201997, April 1997, pp. 261\u2013268.","key":"10.1016\/S0304-3975(00)00182-1_BIB14","DOI":"10.1109\/INFCOM.1997.635138"},{"key":"10.1016\/S0304-3975(00)00182-1_BIB15","first-page":"571","article-title":"On minimum cost network with nonlinear costs","volume":"29","author":"Soukup","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00182-1_BIB16","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1002\/(SICI)1097-0037(199612)28:4<187::AID-NET3>3.0.CO;2-H","article-title":"An approximation scheme for some Steiner tree problems in the plane","volume":"28","author":"Wang","year":"1996","journal-title":"Networks"},{"year":"1996","author":"West","series-title":"Introduction to Graph Theory","key":"10.1016\/S0304-3975(00)00182-1_BIB17"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001821?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001821?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:54:10Z","timestamp":1759625650000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001821"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500001821"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00182-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2001,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximations for Steiner trees with minimum number of Steiner points","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(00)00182-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}