A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Sublinear time algorithms for metric space problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM (JACM)
Sublinear time approximate clustering
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
Sublinear-time approximation of Euclidean minimum spanning tree
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A sublinear algorithm for weakly approximating edit distance
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Sublinear geometric algorithms
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Fast Monte-Carlo Algorithms for finding low-rank approximations
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The regularity lemma and approximation schemes for dense problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Algorithms for dynamic geometric problems over data streams
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Sampling in dynamic data streams and applications
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Online geometric reconstruction
Proceedings of the twenty-second annual symposium on Computational geometry
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
Theoretical Computer Science
Testing Euclidean minimum spanning trees in the plane
ACM Transactions on Algorithms (TALG)
Separating Sublinear Time Computations by Approximate Diameter
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
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
Online geometric reconstruction
Journal of the ACM (JACM)
Facility location in sublinear time
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Research paper: The saga of minimum spanning trees
Computer Science Review
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.00 |
In this paper we present a sublinear time (1 + ε)-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time of the algorithm is Û(n/εO(1)). Since the full description of an n-point metric space is of size Θ(n2), the complexity of our algorithm is sublinear with respect to the input size. Our algorithm is almost optimal as it is not possible to approximate in o(n) time the weight of the minimum spanning tree to within any factor. Furthermore, it has been previously shown that no o(n2) algorithm exists that returns a spanning tree whose weight is within a constant times the optimum.