Proximity Algorithms for Nearly Doubling Spaces
From MaRDI portal
Publication:5408590
DOI10.1137/120874242zbMath1310.68240OpenAlexW2076081748MaRDI QIDQ5408590
Robert Krauthgamer, Lee-Ad J. Gottlieb
Publication date: 10 April 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/120874242
doubling dimensionapproximate distance oraclemetric spannersall points nearest neighborapproximate minimum spanning tree
Analysis of algorithms (68W40) Distance in graphs (05C12) Approximation algorithms (68W25) Embeddings of discrete metric spaces into Banach spaces; applications in topology and computer science (46B85)
Related Items (4)
Gaussian random projections for Euclidean membership problems ⋮ Active Nearest-Neighbor Learning in Metric Spaces ⋮ Non-uniform packings ⋮ On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$
This page was built for publication: Proximity Algorithms for Nearly Doubling Spaces