Sanjeev Arora
Prabhakar Raghavan
Satish Rao
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98
Bypassing the embedding
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems