1. On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality;Andreae,1998
2. Performance guarantees for approximation algorithms depending on parametrized triangle inequalities;Andreae;SIAM J. Discrete Math.,1995
3. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems;Arora,1996
4. Worst-case analysis of a new heuristic for the Traveling Salesman Problem;Christofides,1976
5. Relaxing the triangle inequality in pattern matching;Fagin;Internat. J. Comput. Vision,1998