Abstract
While the problem of approximate nearest neighbor search has been well-studied for Euclidean space and ℓ1, few non-trivial algorithms are known for ℓp when 2<p<∞. In this paper, we revisit this fundamental problem and present approximate nearest-neighbor search algorithms which give the best known approximation factor guarantees in this setting.
Original language | American English |
---|---|
Pages (from-to) | 27-35 |
Number of pages | 9 |
Journal | Theoretical Computer Science |
Volume | 757 |
DOIs | |
State | Published - 24 Jan 2019 |
Bibliographical note
Funding Information:Y. Bartal is supported in part by an Israel Science Foundation grant #1817/17.L. Gottlieb is supported in part by an Israel Science Foundation grant #755/15.
Publisher Copyright:
© 2018 Elsevier B.V.
Keywords
- Nearest neighbor search
- ℓ spaces