2026-07-20T04:52:25Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:24909 2026-02-09T08:01:53Z ddc:004 open_access

Challenges and Opportunities of Graph-Based Algorithms for Similarity Search (Invited Talk) Indyk, Piotr Similarity search Over the last few years, graph-based approaches to nearest neighbor search have attracted renewed interest. Algorithms such as HNSW, NSG, and DiskANN have become popular tools in practice. These algorithms are highly versatile and come with efficient implementations. At the same time, their correctness, performance guarantees, and functionality remain poorly understood. In this talk, I will discuss the challenges and opportunities presented by this class of algorithms. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Piotr Indyk 2025 Is Part Of LIPIcs, Volume 359, 36th International Symposium on Algorithms and Computation (ISAAC 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ISAAC.2025.1 urn:nbn:de:0030-drops-249092 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.1 eng https://creativecommons.org/licenses/by/4.0/legalcode