Approximate nearest neighbor search for ℓp-spaces (2 < p < ∞) via embeddings

Yair Bartal, Lee Ad Gottlieb

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)27-35
Number of pages9
JournalTheoretical Computer Science
StatePublished - 24 Jan 2019


  • Nearest neighbor search
  • ℓ spaces

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Approximate nearest neighbor search for ℓp-spaces (2 < p < ∞) via embeddings'. Together they form a unique fingerprint.

Cite this