An $O(\log k)$-approximation algorithm for the $k$ minimum spanning tree problem in the plane

Naveen Garg and Dorit Hochbaum
Algorithmica 18(1):111–121, 1997
http://link.springer.de/link/service/journals/00453/htabst/18_111-121.html

Cites:

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