论文信息 - Approximating the Minimum Spanning TreeWeight in Sublinear - 字舞流文

Approximating the Minimum Spanning TreeWeight in Sublinear

Ronitt Rubinfeld | Chazelle | R. Rubinfeld | TimeBernard

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

[2] D. Willard,et al. Trans-dichotomous algorithms for minimum spanning trees and shortest paths , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[3] Ronitt Rubinfeld,et al. Robust Chara terizations of Polynomials withAppli ations to Program Testing , 1996 .

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