{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T14:30:30Z","timestamp":1698157830867},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1007\/bf02187919","type":"journal-article","created":{"date-parts":[[2005,10,29]],"date-time":"2005-10-29T04:11:50Z","timestamp":1130559110000},"page":"367-382","source":"Crossref","is-referenced-by-count":12,"title":["A decomposition theorem on Euclidean Steiner minimal trees"],"prefix":"10.1007","volume":"3","author":[{"given":"F. K.","family":"Hwang","sequence":"first","affiliation":[]},{"given":"G. D.","family":"Song","sequence":"additional","affiliation":[]},{"given":"G. Y.","family":"Ting","sequence":"additional","affiliation":[]},{"given":"D. Z.","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1988,12,1]]},"reference":[{"key":"BF02187919_CR1","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1137\/0118014","volume":"18","author":"E. J. Cockayne","year":"1970","unstructured":"E. J. Cockayne, On the efficiency of the algorithm for Steiner minimal trees,SIAM J. Appl. Math. 18 (1970), 150\u2013159.","journal-title":"SIAM J. Appl. Math."},{"key":"BF02187919_CR2","doi-asserted-by":"crossref","unstructured":"D. Z. Du, F. K. Hwang, and G. Y. Ting, Steiner minimal trees on sets of four points,Discrete Comput. Geom. to appear.","DOI":"10.1007\/BF02187892"},{"key":"BF02187919_CR3","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 J. Appl. Math. 32 (1977), 835\u2013859.","journal-title":"SIAM J. Appl. Math."},{"key":"BF02187919_CR4","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 J. Appl. Math. 16 (1968), 1\u201329.","journal-title":"SIAM J. Appl. Math."},{"key":"BF02187919_CR5","doi-asserted-by":"crossref","first-page":"279","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,J. Combin. Theory Ser. A 24 (1978), 279\u2013295.","journal-title":"J. Combin. Theory Ser. A"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187919.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02187919\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187919","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T13:22:36Z","timestamp":1557840156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02187919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["BF02187919"],"URL":"https:\/\/doi.org\/10.1007\/bf02187919","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}