When crossings count — approximating the minimum spanning tree

Sariel Har-Peled and Piotr Indyk
Proc. 16th Symp. Computational Geometry, ACM, Jun 2000, pp. 166–175
ACM Computing Research Repository, cs.CG/0303001

Cites:

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