A constant-factor approximation for the k-MST problem in the plane
Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC ’95
Santosh Vempala
Avrim Blum
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems