{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:24:49Z","timestamp":1762176289829},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. & Technol."],"published-print":{"date-parts":[[2004,12]]},"DOI":"10.1007\/bf02973441","type":"journal-article","created":{"date-parts":[[2008,10,14]],"date-time":"2008-10-14T16:49:33Z","timestamp":1224002973000},"page":"791-794","source":"Crossref","is-referenced-by-count":13,"title":["Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane"],"prefix":"10.1007","volume":"19","author":[{"given":"Zi-Mao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Da-Ming","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shao-Han","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,10,11]]},"reference":[{"key":"BF02973441_CR1","doi-asserted-by":"crossref","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 1 and 2.Information Processing Letters, 1989, 32: 171\u2013176.","journal-title":"Information Processing Letters"},{"key":"BF02973441_CR2","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/s00453-001-0089-4","volume":"32","author":"L Wang","year":"2002","unstructured":"Wang L, Du D Z. Approximations for a bottleneck Steiner tree problem.Algorithmica, 2002, 32: 554\u2013561.","journal-title":"Algorithmica"},{"key":"BF02973441_CR3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0020-0190(01)00209-5","volume":"81","author":"L Wang","year":"2002","unstructured":"Wang L, Li Z. An approximation algorithm for a bottleneckk-Steiner tree problem in the Euclidean plane.Information Processing Letters, 2002, 81: 151\u2013156.","journal-title":"Information Processing Letters"},{"key":"BF02973441_CR4","doi-asserted-by":"crossref","unstructured":"Du D Z, Wang L, Xu B, The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points. InProceedings of the 7th Annual International Conference on Computing and Combinatorics, Guilin, China, August 2001,LNCS 2108, pp.509\u2013518.","DOI":"10.1007\/3-540-44679-6_57"},{"key":"BF02973441_CR5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02579169","volume":"6","author":"H N Gabow","year":"1986","unstructured":"Gabow H N, Stallmann M. An augmenting path algorithm for linear matriod parity.Combinatorica, 1986, 6: 123\u2013150.","journal-title":"Combinatorica"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02973441.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02973441\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02973441","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T19:31:30Z","timestamp":1558553490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02973441"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":5,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["BF02973441"],"URL":"https:\/\/doi.org\/10.1007\/bf02973441","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}