{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T17:40:15Z","timestamp":1738777215240,"version":"3.37.0"},"reference-count":15,"publisher":"Academy Publisher","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JNW"],"DOI":"10.4304\/jnw.9.4.1000-1004","type":"journal-article","created":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T12:49:14Z","timestamp":1396356554000},"source":"Crossref","is-referenced-by-count":2,"title":["Nearly Optimal Solution for Restricted Euclidean Bottleneck Steiner Tree Problem"],"prefix":"10.4304","volume":"9","author":[{"given":"Zimao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenying","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2838","published-online":{"date-parts":[[2014,4,1]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0132072"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90039-2"},{"key":"ref3","volume-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979","unstructured":"[3] M. R. Garey and D. S. Johnson, \"Computers and Intractability, A Guide to the Theory of NP-Completeness,\" W. H. Freeman and Company, New York, 1979."},{"key":"ref4","first-page":"2","article-title":"Polynomial Time Approximation Scheme for Euclidean TSP and Other Geometric Problems","volume-title":"Proceedings of the 37th Annual Symposium on Foundations of Computer Science","author":"Arora","year":"1996","unstructured":"[4] S. Arora, \"Polynomial Time Approximation Scheme for Euclidean TSP and Other Geometric Problems,\" Proceedings of the 37th Annual Symposium on Foundations of Computer Science, Burlington VT, pp. 2-11, Oct. 1996."},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2363-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/43.784119"},{"key":"ref7","volume-title":"The Steiner Tree Problem","author":"Hwang","year":"1992","unstructured":"[7] F. K. Hwang, D. S. Richards and P. Winter, \"The Steiner Tree Problem,\" North-Holland, 1992."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-006-9017-0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0089-4"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/12.127452"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00201-4"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00209-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02973441"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506150"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1086"}],"container-title":["Journal of Networks"],"original-title":[],"deposited":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T17:05:44Z","timestamp":1738775144000},"score":1,"resource":{"primary":{"URL":"https:\/\/dblp.org\/db\/journals\/jnw\/index.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,1]]},"references-count":15,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2014,4,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jnw.9.4.1000-1004","relation":{},"ISSN":["1796-2056"],"issn-type":[{"type":"print","value":"1796-2056"}],"subject":[],"published":{"date-parts":[[2014,4,1]]}}}