The Euclidean Traveling Salesman Problem is np-complete (1977)

by C H Papadimitriou
Venue:Theoretical Computer Science