Approximating geometrical graphs via “spanners” and “banyans”
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98
Satish B Rao
Bypassing the embedding
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems