{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:40:25Z","timestamp":1774629625917,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540633976","type":"print"},{"value":"9783540695363","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63397-9_26","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T15:22:48Z","timestamp":1270480968000},"page":"341-349","source":"Crossref","is-referenced-by-count":4,"title":["Minimum spanning trees in d dimensions"],"prefix":"10.1007","author":[{"given":"Drago","family":"Krznaric","sequence":"first","affiliation":[]},{"given":"Christos","family":"Levcopoulos","sequence":"additional","affiliation":[]},{"given":"Bengt J.","family":"Nilsson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/BF02574698","volume":"6","author":"P. K. Agarwal","year":"1991","unstructured":"Agarwal, P. K., Edelsbrunner, H., Schwarzkopf, O., Welzl, E.: Euclidean minimum spanning trees and bichromatic closest pairs. Discrete & Computational Geometry 6 (1991) 407\u2013422.","journal-title":"Discrete & Computational Geometry"},{"key":"26_CR2","unstructured":"Bespamyatnikh, S. N.: An optimal algorithm for closest pair maintenance. Proc. of the 11th Annual ACM Symposium on Computational Geometry (1995) 152\u2013161."},{"key":"26_CR3","unstructured":"Callahan, P. B., Kosaraju, S. R.: Faster algorithms for some geometric graph problems in higher dimensions. Proc. of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms (1993) 291\u2013300."},{"key":"26_CR4","unstructured":"Clarkson, K.: Fast expected-time and approximate algorithms for geometric minimum spanning tree. Proc. of the 16th Annual ACM Symposium on Theory of Computing (1984) 343\u2013348."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Gabow, H. N., Bentley, J. L., Tarjan, R. E.: Scaling and related techniques for geometry problems. Proc. of the 16th Annual ACM Symposium on Theory of Computing (1984) 135\u2013143.","DOI":"10.1145\/800057.808675"},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. G. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D. G.: Optimal search in planar subdivisions. SIAM Journal on Computing 12 (1983) 28\u201335.","journal-title":"SIAM Journal on Computing"},{"key":"26_CR7","series-title":"Computational Geometry and its Applications","first-page":"148","volume-title":"Abstract Voronoi diagrams and their applications","author":"R. Klein","year":"1988","unstructured":"Klein, R.: Abstract Voronoi diagrams and their applications. Computational Geometry and its Applications (LNCS 333, Springer-Verlag, 1988) 148\u2013157."},{"key":"26_CR8","unstructured":"Krznaric, D., Levcopoulos, C.: Optimal algorithms for complete linkage clustering in d dimensions. Technical Report LU-CS-TR:96-180, Department of Computer Science, Lund University (1996)."},{"key":"26_CR9","unstructured":"Krznaric, D., Levcopoulos, C., Nilsson, B. J.: Minimum spanning trees in d dimensions. Technical Report LU-CS-TR:96-183, Department of Computer Science, Lund University (1996)."},{"key":"26_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"Preparata, F. P., Shamos, M. I.: Computational Geometry: An Introduction. Springer-Verlag, New York (1985)."},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1142\/S0218195991000098","volume":"1","author":"J. S. Salowe","year":"1991","unstructured":"Salowe, J. S.: Constructing multidimensional spanner graphs. International Journal of Computational Geometry & Applications 1 (1991) 99\u2013107.","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Shamos, M. I., Hoey, D. J.: Closest-point problems. Proc. of the 16th Annual IEEE Symposium on Foundations of Computer Science (1975) 151\u2013162.","DOI":"10.1109\/SFCS.1975.8"},{"key":"26_CR13","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1137\/0217035","volume":"17","author":"P. M. Vaidya","year":"1988","unstructured":"Vaidya, P. M.: Minimum spanning trees in k-dimensional space. SIAM Journal on Computing 17 (1988) 572\u2013582.","journal-title":"SIAM Journal on Computing"},{"key":"26_CR14","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"A. C. Yao","year":"1982","unstructured":"Yao, A. C.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing 11 (1982) 721\u2013736.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA '97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63397-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T11:54:48Z","timestamp":1549194888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63397-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633976","9783540695363"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-63397-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}