Avrim Blum
Santosh Vempala
Prasad Chalasani
Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC ’95
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems