{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:05:51Z","timestamp":1762175151149},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0020-0190(01)00209-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"151-156","source":"Crossref","is-referenced-by-count":28,"title":["An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane"],"prefix":"10.1016","volume":"81","author":[{"given":"Lusheng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zimao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00209-5_BIB001","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1008384012064","article-title":"Approximations for Steiner trees with minimum number of Steiner points","volume":"18","author":"Chen","year":"2000","journal-title":"J. Global Optimization"},{"key":"10.1016\/S0020-0190(01)00209-5_BIB002","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.1109\/43.62776","article-title":"A powerful global router: based on Steiner min-max tree","volume":"19","author":"Chiang","year":"1990","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"10.1016\/S0020-0190(01)00209-5_BIB003","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."},{"key":"10.1016\/S0020-0190(01)00209-5_BIB004","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0020-0190(00)00095-8","article-title":"A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points","volume":"75","author":"Mandoiu","year":"2000","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(01)00209-5_BIB005","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1006\/jagm.2000.1086","article-title":"A new approximation algorithm for the Steiner tree problem with performance ratio 5\/3","volume":"36","author":"Pr\u00f6mel","year":"2000","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(01)00209-5_BIB006","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1109\/12.127452","article-title":"Bottleneck Steiner trees in the plane","volume":"41","author":"Sarrafzadeh","year":"1992","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(01)00209-5_BIB007","doi-asserted-by":"crossref","unstructured":"L. Wang, D.-Z. Du, Approximations for a bottleneck Steiner tree problem, Algorithmica, to appear","DOI":"10.1007\/s00453-001-0089-4"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002095?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002095?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:22:44Z","timestamp":1556896964000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0020019001002095"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00209-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}