The Euclidean travelling salesman problem is NP-complete

The Euclidean travelling salesman problem is NP-complete

Christos H. Papadimitriou
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
4
Year:
1977
Language:
english
Pages:
8
DOI:
10.1016/0304-3975(77)90012-3
File:
PDF, 918 KB
english, 1977
Conversion to is in progress
Conversion to is failed