Sublinear time approximation of the cost of a metric k -nearest neighbor graph
Attributed to:
The Centre for Discrete Mathematics and its Applications (DIMAP)
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1137/1.9781611975994.180
Publication URI: http://dx.doi.org/10.1137/1.9781611975994.180
Type: Book Chapter
Book Title: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2020)
Page Reference: 2973-2992