Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels
From MaRDI portal
Publication:4635566
DOI10.1145/2582112.2582161zbMath1395.68278MaRDI QIDQ4635566
Publication date: 23 April 2018
Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2582112.2582161
minimum spanning tree; nearest neighbor; coresets; bichromatic closest pair; \(\varepsilon\)-dependencies
68W40: Analysis of algorithms
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W25: Approximation algorithms
68W20: Randomized algorithms
Related Items
Approximate Polytope Membership Queries, Unnamed Item, Approximate Convex Hull of Data Streams, Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces, Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces, Communication costs in a geometric communication network