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

DOI10.1137/1.9781611975994.180MaRDI QIDQ5146977zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(2)

• Approximate $k$-Nearest Neighbor Graph on Moving Points
• Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146977)