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

First Author: Czumaj A
Attributed to:  Sublinear Algorithms for Big Graphs funded by EPSRC


No abstract provided

Bibliographic Information

Digital Object Identifier:

Publication URI:

Type: Book Chapter

Book Title: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2020)

Page Reference: 2973-2992