Covering points in the plane by k-tours
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC ’97
Hisao Tamaki
Takeshi Tokuyama
Tetsuo Asano
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems