A 3-approximation for the minimum tree spanning $k$ vertices
Naveen Garg
Proc. 37th Symp. Foundations of Computer Science
,
IEEE
,
Oct 1996, pp. 302–309
Cites:
Faster geometric $k$-point MST approximation
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
