Testing Euclidean minimum spanning trees in the plane
ACM Transactions on Algorithms (TALG)
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
Computational Complexity
Separating Sublinear Time Computations by Approximate Diameter
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Proceedings of the forty-first annual ACM symposium on Theory of computing
A sublinear-time approximation scheme for bin packing
Theoretical Computer Science
Counting stars and other small subgraphs in sublinear time
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Local graph exploration and fast property testing
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Property testing
Property testing
Property testing
Property testing
A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
SIAM Journal on Discrete Mathematics
A dense hierarchy of sublinear time approximation schemes for bin packing
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Hi-index | 0.01 |
We consider the problem of computing the weight of a Euclidean minimum spanning tree for a set of n points in $\mathbb R^d$. We focus on the setting where the input point set is supported by certain basic (and commonly used) geometric data structures that can provide efficient access to the input in a structured way. We present an algorithm that estimates with high probability the weight of a Euclidean minimum spanning tree of a set of points to within $1 + \eps$ using only $\widetilde{\O}(\sqrt{n} \, \text{poly} (1/\eps))$ queries for constant d. The algorithm assumes that the input is supported by a minimal bounding cube enclosing it, by orthogonal range queries, and by cone approximate nearest neighbor queries.