"Saving an epsilon: a 2-approximation for the k-MST problem in graphs."

Naveen Garg (2005)
a service of Schloss Dagstuhl - Leibniz Center for Informatics