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; ... ; ω}, and given a parameter 0 < Ɛ < 1/2, estimates in time O(dωƐċ2 log ω/Ɛ) 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 Ω(dωƐċ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.

[1]  D. Eppstein.  Representing all minimum spanning trees with applications to counting and generation , 1995 .

[2]  Seth Pettie,et al.  An Optimal Minimum Spanning Tree Algorithm , 2000, ICALP.

[3]  Bernard Chazelle,et al.  The discrepancy method - randomness and complexity , 2000 .

[4]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[5]  Leonard Pitt,et al.  Sublinear time approximate clustering , 2001, SODA '01.

[6]  Alan M. Frieze,et al.  Quick Approximation to Matrices and Applications , 1999, Comb..

[7]  Michael L. Fredman,et al.  Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths , 1994, J. Comput. Syst. Sci..

[8]  Philip N. Klein,et al.  A randomized linear-time algorithm to find minimum spanning trees , 1995, JACM.

[9]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[10]  Ronald L. Graham,et al.  On the History of the Minimum Spanning Tree Problem , 1985, Annals of the History of Computing.

[11]  Michael L. Fredman,et al.  Surpassing the Information Theoretic Bound with Fusion Trees , 1993, J. Comput. Syst. Sci..

[12]  D. Gale.  Optimal assignments in an ordered set: An application of matroid theory , 1968 .

[13]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 2002, STOC '97.

[14]  J. Nesetril.  A few remarks on the history of MST-problem , 1997 .

[15]  Bernard Chazelle,et al.  A minimum spanning tree algorithm with inverse-Ackermann type complexity , 2000, JACM.