{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T16:35:26Z","timestamp":1751387726772,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325724"},{"type":"electronic","value":"9783642325731"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32573-1_38","type":"book-chapter","created":{"date-parts":[[2012,7,23]],"date-time":"2012-07-23T06:58:33Z","timestamp":1343026713000},"page":"225-228","source":"Crossref","is-referenced-by-count":4,"title":["Performance Evaluation: Ball-Treeand KD-Tree in the Context of MST"],"prefix":"10.1007","author":[{"given":"Hazarath","family":"Munaga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkata","family":"Jarugumalli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. Preparata","year":"1985","unstructured":"Preparata, F., Shamos, M.: Computational Geometry. Springer, New York (1985)"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0012-365X(00)00224-7","volume":"233","author":"Nesetril","year":"2001","unstructured":"Nesetril: OtakarBoruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history. Discrete Math.\u00a0233, 3\u201336 (2001)","journal-title":"Discrete Math."},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. J. Bell Sys. Tech., 1389\u20131401 (1957)","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc.\u00a07, 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"key":"38_CR5","unstructured":"Narasimhan, G., Zachariasen, M., Zhu, J.: Experiments with computing geometric minimum spanning trees. In: Proceedings of ALENEX 2000, pp. 183\u2013196 (2000)"},{"key":"38_CR6","unstructured":"Gray, A., Moore, A.W.: N-body problems in statistical learning. In: Advances in Neural Information Processing Systems, pp. 521\u2013527 (2001)"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"William, B.M., Parikshit, R., Alexander, G.: Fast Euclidean Minimum Spanning Tree: algorithm, analysis, and applications. In: 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 603\u2013612 (2010)","DOI":"10.1145\/1835804.1835882"},{"key":"38_CR8","first-page":"671","volume-title":"2008 Proceedings of the 40th Annual ACM Symposium on Theory of Computing","author":"M. Balcan","year":"2008","unstructured":"Balcan, M., Blum, A., Vempala, S.: A discriminative framework for clustering via similarity functions. In: 2008 Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 671\u2013680. ACM, New York (2008)"},{"key":"38_CR9","unstructured":"Sloan Digital Sky Survey, http:\/\/sdss2.lib.uchicago.edu\/dr7\/en\/ (accessed on January 15, 2011)"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E.: Data Structures and Network Algorithms. In: Society for industrial Applied Mathematics, vol.\u00a044 (1983)","DOI":"10.1137\/1.9781611970265"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MAHC.1985.10011","volume":"7","author":"R.L. Graham","year":"1985","unstructured":"Graham, R.L., Pavol, H.: On the history of the Minimum Spanning Tree Problem. J. IEEE Ann. Hist. Comput.\u00a07, 43\u201357 (1985)","journal-title":"J. IEEE Ann. Hist. Comput."},{"key":"38_CR12","unstructured":"Moore, A.W.: An intoductory tutorial on kd-trees. Technical Report No. 209, Computer Laboratory. University of Cambridge (1991)"},{"key":"38_CR13","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Clifford, S.: Introduction to Algorithms, 3rd edn. MIT Press and McGraw-Hill (2009)"},{"key":"38_CR14","unstructured":"Omohundro, S.M.: Five Balltree Construction Algorithms, ICSI Technical Report TR-89-063 (December 1989)"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Warren, M.S., Salmon, J.K.: A parallel hashed Oct-Tree N-body algorithm. In: Proceedings of the ACM\/IEEE Conference on Supercomputing, pp. 12\u201321 (1993)","DOI":"10.1145\/169627.169640"},{"key":"38_CR16","unstructured":"Machine Learning Group at university of Waikato, http:\/\/www.cs.waikato.ac.nz\/ml\/weka\/ (accessed on August 25, 2010)"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Signal Processing and Information Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32573-1_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T06:52:09Z","timestamp":1743835929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32573-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325724","9783642325731"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32573-1_38","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2012]]}}}