{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:54:08Z","timestamp":1758819248019},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2003,12,5]],"date-time":"2003-12-05T00:00:00Z","timestamp":1070582400000},"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":[[2004,4]]},"DOI":"10.1007\/s00453-003-1056-z","type":"journal-article","created":{"date-parts":[[2004,2,20]],"date-time":"2004-02-20T11:57:08Z","timestamp":1077278228000},"page":"577-589","source":"Crossref","is-referenced-by-count":13,"title":["Computing a (1+\u03b5)-Approximate Geometric Minimum-Diameter Spanning Tree"],"prefix":"10.1007","volume":"38","author":[{"given":"Michael J.","family":"Spriggs","sequence":"first","affiliation":[]},{"given":"J. Mark","family":"Keil","sequence":"additional","affiliation":[]},{"given":"Sergei","family":"Bespamyatnikh","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Segal","sequence":"additional","affiliation":[]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,12,5]]},"reference":[{"key":"1056_CR1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/200836.200853","volume":"42","author":"P. Callahan","year":"1995","journal-title":"Journal of the ACM"},{"key":"1056_CR2","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/0377-2217(80)90164-2","volume":"5","author":"P.M. Camerini","year":"1980","journal-title":"European Journal of Operational Research"},{"key":"1056_CR3","unstructured":"T. Chan, Semi-online maintenance of geometric optima and measures, Proceedings of the 13th ACM\u2013SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 474\u2013483."},{"key":"1056_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-9260(96)00008-9","volume":"21","author":"J. Cong","year":"1996","journal-title":"Integration: the VLSI Journal"},{"key":"1056_CR5","doi-asserted-by":"crossref","unstructured":"D. Eppstein, Spanning trees and spanners, in Handbook of Computational Geometry (J.R. Sack and J. Urrutia, eds.), North-Holland, Amsterdam, 2000, pp. 425\u2013462.","DOI":"10.1016\/B978-044482537-7\/50010-3"},{"key":"1056_CR6","doi-asserted-by":"crossref","unstructured":"J. Gudmundsson, H. Haverkort, S.-M. Park, C.-S. Shin, and A. Wolff, Facility location and the geometric minimum-diameter spanning tree, in Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), 2002, pp. 146\u2013160.","DOI":"10.1007\/3-540-45753-4_14"},{"key":"1056_CR7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0020-0190(94)00183-Y","volume":"53","author":"R. Hassin","year":"1995","journal-title":"Information Processing Letters"},{"key":"1056_CR8","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1137\/0220060","volume":"20","author":"J. Ho","year":"1991","journal-title":"SIAM Journal on Computing"},{"key":"1056_CR9","unstructured":"W. D. Jones, Euclidean Communication Spanning Trees, M.Sc. Thesis, University of Saskatchewan, 1994."},{"key":"1056_CR10","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","journal-title":"SIAM Journal on Applied Mathematics"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-003-1056-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-003-1056-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-003-1056-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:40:29Z","timestamp":1559137229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-003-1056-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12,5]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["1056"],"URL":"https:\/\/doi.org\/10.1007\/s00453-003-1056-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,12,5]]}}}