{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T21:09:04Z","timestamp":1764364144049,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,8]],"date-time":"2014-06-08T00:00:00Z","timestamp":1402185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,8]]},"DOI":"10.1145\/2582112.2582161","type":"proceedings-article","created":{"date-parts":[[2014,5,2]],"date-time":"2014-05-02T14:01:31Z","timestamp":1399039291000},"page":"416-425","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Better \u03f5-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and \u03f5-Kernels"],"prefix":"10.1145","author":[{"given":"Sunil","family":"Arya","sequence":"first","affiliation":[{"name":"Department of Computer Sci. & Eng., HKUST, Hong Kong"}]},{"given":"Timothy M.","family":"Chan","sequence":"additional","affiliation":[{"name":"Cheriton School of Computer Science, University of Waterloo, Canada"}]}],"member":"320","published-online":{"date-parts":[[2014,6,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/98524.98567"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008736"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(92)90001-9"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.76"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993713"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095119"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1613676.1613677"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"issue":"4","key":"e_1_3_2_1_9_1","first-page":"553","article-title":"Approximate weighted farthest neighbors and minimum dilation stars. Discrete Math","volume":"2","author":"Augustine J.","year":"2010","unstructured":"J. Augustine , D. Eppstein , and K. A. Wortman . Approximate weighted farthest neighbors and minimum dilation stars. Discrete Math ., Algorithms and Applications , 2 ( 4 ): 553 -- 566 , 2010 . J. Augustine, D. Eppstein, and K. A. Wortman. Approximate weighted farthest neighbors and minimum dilation stars. Discrete Math., Algorithms and Applications, 2(4):553--566, 2010.","journal-title":"Algorithms and Applications"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(80)90015-2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.391389"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00967115"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/313559.313777"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200853"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009390"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009478"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195902000748"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2005.10.002"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.02.008"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/177424.177609"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703435297"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/060672121"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9045(74)90120-8"},{"key":"e_1_3_2_1_24_1","first-page":"769","volume-title":"Proc. 12th Annu. ACM-SIAM Sympos. Discrete Algorithms","author":"Goel A.","year":"2001","unstructured":"A. Goel , P. Indyk , and K. R. Varadarajan . Reductions among high dimensional proximity problems . In Proc. 12th Annu. ACM-SIAM Sympos. Discrete Algorithms , pages 769 -- 778 , 2001 . A. Goel, P. Indyk, and K. R. Varadarajan. Reductions among high dimensional proximity problems. In Proc. 12th Annu. ACM-SIAM Sympos. Discrete Algorithms, pages 769--778, 2001."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2031416"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1049"},{"issue":"4","key":"e_1_3_2_1_28_1","first-page":"446","article-title":"Minimum spanning trees in d dimensions","volume":"6","author":"Krznaric D.","year":"1999","unstructured":"D. Krznaric , C. Levcopoulos , and B. J. Nilsson . Minimum spanning trees in d dimensions . Nord. J. Comput. , 6 ( 4 ): 446 -- 461 , 1999 . D. Krznaric, C. Levcopoulos, and B. J. Nilsson. Minimum spanning trees in d dimensions. Nord. J. Comput., 6(4):446--461, 1999.","journal-title":"Nord. J. Comput."},{"key":"e_1_3_2_1_29_1","unstructured":"M. H.\n      Overmars\n    . \n      The Design\n       of \n      Dynamic Data Structures volume \n  156\n   of \n  Lecture Notes in Computer Science\n  . \n  Springer 1983\n  .   M. H. Overmars. The Design of Dynamic Data Structures volume 156 of Lecture Notes in Computer Science. Springer 1983."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90093-4"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217035"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9392-2"}],"event":{"name":"SOCG'14: Annual Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Kyoto Japan","acronym":"SOCG'14"},"container-title":["Proceedings of the thirtieth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2582112.2582161","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2582112.2582161","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:10:09Z","timestamp":1750234209000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2582112.2582161"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,8]]},"references-count":32,"alternative-id":["10.1145\/2582112.2582161","10.1145\/2582112"],"URL":"https:\/\/doi.org\/10.1145\/2582112.2582161","relation":{},"subject":[],"published":{"date-parts":[[2014,6,8]]},"assertion":[{"value":"2014-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}