Approximating the minimum spanning tree weight in sublinear time

SIAM Journal on Computing

Volumn 34, Issue 6, 2005, Pages 1370-1379

  Chazelle, Bernard ^a   Rubinfeld, Ronitt ^b   Trevisan, Luca ^c  

^a Princeton University   (United States)

^b Department of Electrical Engineering and Computer Science   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation algorithms; Minimum spanning tree; Randomized algorithms; Sublinear time algorithms

Indexed keywords

APPROXIMATION ALGORITHMS; MINIMUM SPANNING TREE (MST); RANDOMIZED ALGORITHMS; SUBLINEAR TIME ALGORITHMS;

ALGORITHMS; ESTIMATION; GRAPH THEORY; MATHEMATICAL TECHNIQUES; PROBABILITY; RELATIVITY;

APPROXIMATION THEORY;

EID: 29344458334     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702403244     Document Type: Article

References (16)

1. N. ALON, S. DAR, M. PARNAS, AND D. RON, Testing of clustering, SIAM J. Discrete Math., 16 (2003), pp. 393-417.
2. B. CHAZELLE, A minimum spanning tree algorithm with inverse-Ackermann type complexity, J. ACM, 47 (2000), pp. 1028-1047.
3. B. CHAZELLE, The Discrepancy Method: Randomness and Complexity, Cambridge University Press, Cambridge, UK, 2000.
4. M. L. FREDMAN AND D. E. WILLARD, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, J. Comput. System Sci., 48 (1994), pp. 533-551.
5. A. FRIEZE AND R. KANNAN, Quick approximation to matrices and applications, Combinatorica, 19 (1999), pp. 175-220.
6. A. FRIEZE, R. KANNAN, AND S. VEMPALA, Fast Monte-Carlo algorithms for finding low-rank approximations, J. ACM, 51 (2004), pp. 1025-1041.
7. D. GALE, Optimal assignments in an ordered set: An application of matroid theory, J. Combinatorial Theory, 4 (1968), pp. 176-180.
8. O. GOLDREICH, S. GOLDWASSER, AND D. RON, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750.
9. O. GOLDREICH AND D. RON, Property testing in bounded degree graphs, Algorithmica, 32 (2002), pp. 302-343.
10. R. L. GRAHAM AND P. HELL, On the history of the minimum spanning tree problem, Ann. Hist. Comput., 7 (1985), pp. 43-57.
11. D. R. KARGER, P. N. KLEIN, AND R. E. TARJAN, A randomized linear-time algorithm to find minimum spanning trees, J. ACM, 42 (1995), pp. 321-328.
12. J. NEŠETŘIL, A few remarks on the history of MST-problem, Arch. Math. (Brno), 33 (1997), pp. 15-22.
13. S. PETTIE AND V. RAMACHANDRAN, An optimal minimum spanning tree algorithm, in Automata, Languages and Programming (Geneva, 2000), Lecture Notes in Comput. Sci. 1853, Springer-Verlag, Berlin, 2000, pp. 49-60.
14. N. MISHRA, D. OBLINGER, AND L. PITT, Sublinear time approximate clustering, in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2001, pp. 439-447.
15. D. RON, Property testing, in Handbook of Randomized Computing, Vol. II, S. Rajasekaran, P. M. Pardalos, J. H. Reif, and J. D. P. Rolim, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001, pp. 597-649.
16. R. RUBINFELD AND M. SUDAN, Robust characterizations of polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271.