Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees

Information Processing Letters

Volumn 67, Issue 6, 1998, Pages 303-304

  Chan, Timothy M ^a  

^a UNIVERSITY OF MIAMI   (United States)

Author keywords

Algorithms; Backwards analysis; Minimum spanning trees; Randomized algorithms

Indexed keywords

ALGORITHMS; RANDOM PROCESSES; THEOREM PROVING;

BACKWARDS ANALYSIS; KARGER-KLEIN-TARJAN ALGORITHM; MINIMUM SPANNING TREES;

TREES (MATHEMATICS);

EID: 0032154391     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00129-x     Document Type: Article

References (7)

1. D.R. Karger, Random sampling and greedy sparsification for matroid optimization problems, Math. Programming 82 (1998) 41-81; also in: Proc. 34th IEEE Symp. Foundations of Computer Science, 1993, pp. 84-93.
2. D.R. Karger, Random sampling and greedy sparsification for matroid optimization problems, Math. Programming 82 (1998) 41-81; also in: Proc. 34th IEEE Symp. Foundations of Computer Science, 1993, pp. 84-93.
3. D.R. Karger, RN. Klein, R.E. Tarjan, A randomized linear-time algorithm to find minimum spanning trees, J. ACM 42 (1995) 321-328.
4. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, New York, 1995.
5. K. Mulmuley, Computational Geometry: An Introduction Through Randomized Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1994.
6. R. Seidel, Backwards analysis of randomized geometric algorithms, in: J. Pach (Ed.), New Trends in Discrete and Computational Geometry, Algorithms and Combinatorics, Vol. 10, Springer, Berlin, 1993, pp. 37-68.
7. M. Sharir, E. Welzl, A combinatorial bound for linear programming and related problems, in: Proc. 9th Symp. Theoretical Aspects of Computer Science, Lecture Notes in Comput. Sci., Vol. 577, Springer, Berlin, 1992, pp. 569-579.