Arrow Research search
Back to STOC

STOC 2004

Estimating the weight of metric minimum spanning trees in sublinear-time

Conference Paper Session 5A Algorithms and Complexity ยท Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
582747576886301474