Approximating the minimum spanning tree weight in sublinear time

Bernard Chazelle, Ronitt Rubinfeld, and Luca Trevisan
Proc. 28th Int. Coll. Automata, Languages, and Programming (ICALP 2001), Lecture Notes in Computer Science 2076, Fernando Orejas, Paul G. Spirakis, and Jan van Leeuwen, ed., Springer-Verlag, 2001, pp. 190–200

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!