📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

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

First Author: Czumaj A.

Attributed to: Sublinear Algorithms for Big Graphs funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Type: Other

Volume: 2020-January

Parent Publication: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms