{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:57:22Z","timestamp":1649030242458},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1995,4]]},"DOI":"10.1007\/bf01293486","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T22:39:41Z","timestamp":1111703981000},"page":"381-386","source":"Crossref","is-referenced-by-count":0,"title":["On greedy heuristics for steiner minimum trees"],"prefix":"10.1007","volume":"13","author":[{"given":"Ding -Zhu","family":"Du","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1006\/jagm.1994.1041","volume":"17","author":"P. Berman","year":"1994","unstructured":"P. Berman and V. Ramaiye, An approximation algorithm for the Steiner tree problem,Journal of Algorithms,17 (1994), 381?408.","journal-title":"Journal of Algorithms"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1111\/j.1749-6632.1985.tb14564.x","volume":"440","author":"F. R. K. Chung","year":"1985","unstructured":"F. R. K. Chung and R. L. Graham, A new bound for Euclidean Steiner minimum trees,Annals of the New York Academy of Sciences,440 (1985), 328?346.","journal-title":"Annals of the New York Academy of Sciences"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1137\/0134003","volume":"34","author":"F. R. K. Chung","year":"1978","unstructured":"F. R. K. Chung and F. K. Hwang, A lower bound for the Steiner tree problem,SIAM Journal of Applied Mathematics,34 (1978), 27?36.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"CR4","unstructured":"T. Cole, A problem in Steiner networks, Manuscript."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1090\/S0002-9947-1983-0697065-3","volume":"278","author":"D. Z. Du","year":"1983","unstructured":"D. Z. Du and F. K. Hwang, A new bound for the Steiner ratio,Transactions of the American Mathematical Society,278 (1983), 137?148.","journal-title":"Transactions of the American Mathematical Society"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01758755","volume":"7","author":"D. Z. Du","year":"1992","unstructured":"D. Z. Du and F. K. Hwang, A proof of the Gilbert-Pollak conjecture on the Steiner ratio,Algorithmica,7 (1992), 121?135.","journal-title":"Algorithmica"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"D. Z. Du, Y. Zhang, and Q. Feng, On better heuristic for Euclidean Steiner minimum trees,Proceedings of the and Symposium on the Foundations of Computer Science, 1991.","DOI":"10.1109\/SFCS.1991.185402"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"M. R. Garey","year":"1977","unstructured":"M. R. Garey, R. L. Graham, and D. S. Johnson, The complexity of computing Steiner minimal trees,SIAM Journal of Applied Mathematics,32 (1977), 835?859.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"E. N. Gilbert","year":"1968","unstructured":"E. N. Gilbert and H. O. Pollak, Steiner minimal trees,SIAM Journal of Applied Mathematics,16 (1968), 1?29.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"CR10","first-page":"177","volume":"4","author":"R. L. Graham","year":"1976","unstructured":"R. L. Graham and F. K. Hwang, Remarks on Steiner minimal trees,Bulletin of the Institute of Mathematics, Academia Sinica,4 (1976), 177?182.","journal-title":"Bulletin of the Institute of Mathematics, Academia Sinica"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0097-3165(78)90058-4","volume":"24","author":"H. O. Pollak","year":"1978","unstructured":"H. O. Pollak, Some remarks on the Steiner problem,Journal of Combinatorial Theory, Series A,24 (1978), 278?295.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/0097-3165(91)90073-P","volume":"58","author":"J. H. Rubinstein","year":"1991","unstructured":"J. H. Rubinstein and D. A. Thomas, The Steiner ratio conjecture for six points,Journal of Combinatorial Theory, Series A,58 (1991), 54?77.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF02071984","volume":"33","author":"J. H. Rubinstein","year":"1991","unstructured":"J. H. Rubinstein and D. A. Thomas, The calculus of variations and the Steiner problem,Annals of Operations Research,33 (1991), 481?499.","journal-title":"Annals of Operations Research"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01758766","volume":"7","author":"W. D. Smith","year":"1992","unstructured":"W. D. Smith and P. W. Shor, Steiner tree problems,Algorithmica,7 (1992), 329?332.","journal-title":"Algorithmica"},{"key":"CR15","first-page":"901","volume":"27","author":"Hong Yi","year":"1982","unstructured":"Hong Yi, Yang Hongcang, and Du Dingzhu, An inequality for convex functions,Kexue Tongbao 27 (1982), 901?904.","journal-title":"Kexue Tongbao"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01187035","volume":"9","author":"A. Z. Zelikovsky","year":"1993","unstructured":"A. Z. Zelikovsky, The 11\/6-approximation algorithm for the Steiner problem on networks,Algorithmica,9 (1993), 463?470.","journal-title":"Algorithmica"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293486.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01293486\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T07:18:31Z","timestamp":1556781511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01293486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["BF01293486"],"URL":"https:\/\/doi.org\/10.1007\/bf01293486","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}