Computers and Intractability: A Guide to the Theory of NP-Completeness.
The geometric maximum traveling salesman problem
How easy is local search?
Journal of Computer and System Sciences
Journal of the ACM
Sándor P. Fekete
M. R. Garey
Alexander Barvinok
Arie Tamir
Christos H. Papadimitriou
Mihalis Yannakakis
Comparando mapas conceituais utilizando correspondência de grafos
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems