📣 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

First Author: Czumaj A

Attributed to: Sublinear Algorithms for Big Graphs 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