The Traveling Salesman Problem with Distances One and Two
On complexity as bounded rationality (extended abstract)
How easy is local search?
On the hardness of approximating minimization problems
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC ’94
Journal of Computer and System Sciences
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC ’93
Mathematics of Operations Research
Christos H. Papadimitriou
Carsten Lund
David S. Johnson
Beyond nash equilibrium
The geometric maximum traveling salesman problem
Two prover protocols
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems