Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of maximum degree d, with edge weights in the set 1,..., w, and given a parameter 0 < ε < 1/2, estimates in time O(dw∈-2 log w/∈ ) the weight of the minimum spanning tree of G with a relative error of at most ε. Note that the running time does not depend on the number of vertices in G. We also prove a nearly matching lower bound of Ω(dw∈-2) on the probe and time complexity of any approximation algorithm for MST weight.
The essential component of our algorithm is a procedure for estimating in time O(dε-2 log ε-1) the number of connected components of an unweighted graph to within an additive error of εn. The time bound is shown to be tight up to within the log ε-1 factor. Our connected- components algorithm picks O(1/∈2) vertices in the graph and then grows “local spanning trees” whose sizes are specified by a stochastic process. From the local information collected in this way, the algorithm is able to infer, with high confidence, an estimate of the number of connected components. We then show how estimates on the number of components in various subgraphs of G can be used to estimate the weight of its MST.
Unable to display preview. Download preview PDF.
- Alon, N., Dar, S., Parnas, M., Ron, D., Testing of clustering, Proc. FOCS, 2000.Google Scholar
- Chazelle, B., The Discrepancy Method: Randomness and Complexity, Cambridge University Press, 2000.Google Scholar
- Eppstein, D., Representing all minimum spanning trees with applications to counting and generation, Tech. Rep. 95-50, ICS, UCI, 1995.Google Scholar
- Frieze, A., Kannan, R. Quick approximation to matrices and applications, Combinatorica, 19 (1999)Google Scholar
- Frieze, A., Kannan, R., Vempala, S., Fast monte-carlo algorithms for finding low-rank approximations, Proc. 39th FOCS (1998).Google Scholar
- Goldreich, O., Goldwasser, S., Ron, D., Property testing and its connection to learning and approximation, Proc. 37th FOCS (1996), 339–348.Google Scholar
- Goldreich, O., Ron, D., Property testing in bounded degree graphs, Proc. 29th STOC (1997), 406–415.Google Scholar
- Pettie, S., Ramachandran, V. An optimal minimum spanning tree algorithm, Proc. 27th ICALP (2000).Google Scholar
- Ron, D., Property testing (a tutorial), to appear in “Handbook on Randomization.”Google Scholar