Sublinear time approximation of the cost of a metric k-nearest neighbor graph

DOI10.1137/1.9781611975994.180OpenAlexW2996826247MaRDI QIDQ5146977

Christian Sohler, Artur Czumaj

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975994.180

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Sublinear time approximation of the cost of a metric k-nearest neighbor graph