## Approximating the Minimum Spanning Tree Weight in Sublinear Time (2001)

### Cached

### Download Links

- [www.cs.princeton.edu]
- [www.cs.princeton.edu]
- [external.nj.nec.com]
- [www.cs.princeton.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proceedings of the 28th Annual International Colloquium on Automata, Languages and Programming (ICALP |

Citations: | 44 - 6 self |

### BibTeX

@INPROCEEDINGS{Chazelle01approximatingthe,

author = {Bernard Chazelle and Ronitt Rubinfeld and Luca Trevisan},

title = {Approximating the Minimum Spanning Tree Weight in Sublinear Time},

booktitle = {In Proceedings of the 28th Annual International Colloquium on Automata, Languages and Programming (ICALP},

year = {2001},

pages = {190--200}

}

### Years of Citing Articles

### OpenURL

### Abstract

We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1,...,w}, and given a parameter 0 < ε < 1/2, estimates in time O(dwε−2 log dw ε) the weight of the minimum span-ning 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 d ε) the number of connected components of an unweighted graph to within an additive error of εn. (This becomes O(ε−2 log 1 ε) for d = O(1).) The time bound is shown to be tight up to within the log d ε 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

### Citations

431 | Property testing and its connection to learning and approximation
- Goldreich, Goldwasser, et al.
- 1998
(Show Context)
Citation Context ...nd sometimes necessary to find very fast algorithms which can assert nontrivial properties of the data in sublinear time. One direction of research that has been suggested is that of property testing =-=[16, 8]-=-, which relaxes the standard notion of a decision problem. Property testing algorithms distinguish between inputs that have a certain property and those that are far (in terms of Hamming distance or s... |

333 | Robust characterizations of polynomials with applications to program testing
- Rubinfeld, Sudan
- 1996
(Show Context)
Citation Context ...nd sometimes necessary to find very fast algorithms which can assert nontrivial properties of the data in sublinear time. One direction of research that has been suggested is that of property testing =-=[16, 8]-=-, which relaxes the standard notion of a decision problem. Property testing algorithms distinguish between inputs that have a certain property and those that are far (in terms of Hamming distance or s... |

181 | Fast Monte-Carlo Algorithms for Finding Low Rank Approximations
- Frieze, Kannan, et al.
- 1998
(Show Context)
Citation Context ...g can be viewed as a natural type of approximation problem, and, in fact, many of the property testers have led to very fast, even constant time, approximation schemes for the associated problem (cf. =-=[8, 5, 6, 1]-=-). For example, one can approximate the ∗Received by the editors February 27, 2002; accepted for publication (in revised form) November 9, 2004; published electronically July 26, 2005. A preliminary v... |

161 |
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Fredman, Willard
- 1994
(Show Context)
Citation Context ...(m, n)) time, where n (resp., m) is the number of vertices (resp., edges) and α is inverse-Ackermann. The randomized algorithm of Karger, Klein, and Tarjan [11] runs in linear expected time (see also =-=[4, 13]-=- for alternative models). In this paper, we show that there are conditions under which it is possible to approximate the weight of the MST of a connected graph in time sublinear in the number of edges... |

121 | Quick approximation to matrices and applications
- Frieze, Kannan
- 1999
(Show Context)
Citation Context ...g can be viewed as a natural type of approximation problem, and, in fact, many of the property testers have led to very fast, even constant time, approximation schemes for the associated problem (cf. =-=[8, 5, 6, 1]-=-). For example, one can approximate the ∗Received by the editors February 27, 2002; accepted for publication (in revised form) November 9, 2004; published electronically July 26, 2005. A preliminary v... |

120 | Property testing in bounded degree graphs
- Goldreich, Ron
- 1997
(Show Context)
Citation Context ...—and produces an estimate that is within an additive error of εn of the true count. The method is based on a similar principle as the property tester for graph connectivity given by Goldreich and Ron =-=[9]-=-. We give a lower bound of Ω(dw/ε 2 ) on the time complexity of any algorithm which approximates the MST weight. In order to prove the lower bound, we give two distributions on weighted graphs, where ... |

119 | A randomized linear-time algorithm to find minimum spanning trees
- Karger, Klein, et al.
- 1995
(Show Context)
Citation Context ...istic algorithm of Chazelle [2] runs in O(mα(m, n)) time, where n (resp., m) is the number of vertices (resp., edges) and α is inverse-Ackermann. The randomized algorithm of Karger, Klein, and Tarjan =-=[11]-=- runs in linear expected time (see also [4, 13] for alternative models). In this paper, we show that there are conditions under which it is possible to approximate the weight of the MST of a connected... |

102 |
The Discrepancy Method: Randomness and Complexity
- Chazelle
- 2001
(Show Context)
Citation Context ...in linear or near-linear time. In this paper, we consider the problem of finding the weight of the minimum spanning tree (MST) of a graph. Finding the MST of a graph has a long, distinguished history =-=[3, 10, 12]-=-. Currently the best known deterministic algorithm of Chazelle [2] runs in O(mα(m, n)) time, where n (resp., m) is the number of vertices (resp., edges) and α is inverse-Ackermann. The randomized algo... |

94 |
On the history of minimum spanning tree problem
- Graham, L, et al.
- 1985
(Show Context)
Citation Context ...in linear or near-linear time. In this paper, we consider the problem of finding the weight of the minimum spanning tree (MST) of a graph. Finding the MST of a graph has a long, distinguished history =-=[3, 10, 12]-=-. Currently the best known deterministic algorithm of Chazelle [2] runs in O(mα(m, n)) time, where n (resp., m) is the number of vertices (resp., edges) and α is inverse-Ackermann. The randomized algo... |

78 |
A minimum spanning tree algorithm with inverse-Ackermann type complexity
- CHAZELLE
(Show Context)
Citation Context ...inding the weight of the minimum spanning tree (MST) of a graph. Finding the MST of a graph has a long, distinguished history [3, 10, 12]. Currently the best known deterministic algorithm of Chazelle =-=[2]-=- runs in O(mα(m, n)) time, where n (resp., m) is the number of vertices (resp., edges) and α is inverse-Ackermann. The randomized algorithm of Karger, Klein, and Tarjan [11] runs in linear expected ti... |

58 | Testing of clustering
- Alon, Dar, et al.
- 2000
(Show Context)
Citation Context ...g can be viewed as a natural type of approximation problem, and, in fact, many of the property testers have led to very fast, even constant time, approximation schemes for the associated problem (cf. =-=[8, 5, 6, 1]-=-). For example, one can approximate the ∗Received by the editors February 27, 2002; accepted for publication (in revised form) November 9, 2004; published electronically July 26, 2005. A preliminary v... |

47 | An optimal minimum spanning tree algorithm
- Pettie, Ramachandran
(Show Context)
Citation Context ...(m, n)) time, where n (resp., m) is the number of vertices (resp., edges) and α is inverse-Ackermann. The randomized algorithm of Karger, Klein, and Tarjan [11] runs in linear expected time (see also =-=[4, 13]-=- for alternative models). In this paper, we show that there are conditions under which it is possible to approximate the weight of the MST of a connected graph in time sublinear in the number of edges... |

45 | Sublinear time approximate clustering
- Mishra, Oblinger, et al.
- 2001
(Show Context)
Citation Context ...e instances of graph bisection, general partitioning problems, quadratic assignment, minimum linear arrangement, and maximum acyclic subgraph and constraint satisfaction [8, 5], as well as clustering =-=[1, 14]-=-. Note that typically such schemes approximate the value of the optimal solution, for example, the size of a maxcut, without computing the structure that achieves it, i.e., the actual cut. Sometimes, ... |

38 |
Property testing in bounded degree graphs. Algorithmica
- Goldreich, Ron
- 2002
(Show Context)
Citation Context ...or O(ε−2 log 1 ε estimate that is within an additive error of εn of the true count. The method is based on a similar principle as the property tester for graph connectivity given by Goldreich and Ron =-=[9]-=-. We give a lower bound of Ω(dw/ε2 ) on the time complexity of any algorithm which approximates the MST weight. In order to prove the lower bound, we give two distributions on weighted graphs, where t... |

29 |
Optimal assignments in an ordered set: an application of matroid theory
- Gale
(Show Context)
Citation Context ...er w ≥ 2, Fig. 2. Approximating the weight of the MST. w−1 � M(G) =n − w + c (i) . Proof. Let αi be the number of edges of weight i in an MST of G. (Note that αi is independent of which MST we choose =-=[7]-=-.) Observe that for all 0 ≤ ℓ ≤ w − 1, � i>ℓ αi = c (ℓ) − 1; therefore M(G) = w� iαi = i=1 w−1 � ℓ=0 w� i=ℓ+1 i=1 w−1 � αi = −w + ℓ=0 c (ℓ) w−1 � = n − w + Thus, computing the number of connected comp... |

26 |
Property Testing (A Tutorial
- Ron
- 2001
(Show Context)
Citation Context ...ming distance, or some other natural distance) from having the property. Sublinear and even constant time algorithms have been designed for testing various algebraic and combinatorial properties (see =-=[15]-=- for a survey). Property testing can be viewed as a natural type of approximation problem and, in fact, many of the property testers have led to very fast, even constant time, approximation schemes fo... |

21 | A randomized lineartime algorithm to minimum spanning trees - Karger, Klein, et al. - 1995 |

11 | Fast Monte-Carlo Algorithms for Low-Rank Approximations - Frieze, Kannan, et al. - 1998 |

7 | Representing all Minimum Spanning Trees with Applications to Counting and Generation - Eppstein - 1995 |

4 |
A few remarks on the history of the MST-Problem
- Neˇsetˇril
- 1997
(Show Context)
Citation Context ...in linear or near-linear time. In this paper, we consider the problem of finding the weight of the minimum spanning tree (MST) of a graph. Finding the MST of a graph has a long, distinguished history =-=[3, 10, 12]-=-. Currently the best known deterministic algorithm of Chazelle [2] runs in O(mα(m, n)) time, where n (resp., m) is the number of vertices (resp., edges) and α is inverse-Ackermann. The randomized algo... |

3 | A few remarks on the history of MST-problem, Archivum Mathematicum, Brno 33 - Nesetril - 1997 |

2 |
Property testing. In Handbook of randomized computing, Vol
- Ron
- 2001
(Show Context)
Citation Context ...mming distance or some other natural distance) from having the property. Sublinear and even constant time algorithms have been designed for testing various algebraic and combinatorial properties (see =-=[15]-=- for a survey). Property testing can be viewed as a natural type of approximation problem, and, in fact, many of the property testers have led to very fast, even constant time, approximation schemes f... |

1 |
A few remarks on the history of MST-problem, Archivum Mathematicum, Brno 33
- Neˇsetˇril
- 1997
(Show Context)
Citation Context ...in linear or near-linear time. In this paper, we consider the problem of finding the weight of the minimum spanning tree (MST) of a graph. Finding the MST of a graph has a long, distinguished history =-=[3, 10, 12]-=-. Currently the best known deterministic algorithm of Chazelle [2] runs in O(mα(m,n)) time, where n (resp. m) is the number of vertices (resp. edges) and α is inverse-Ackermann. The randomized algorit... |