The Euclidean travelling salesman problem is NP-complete
Christos H. PapadimitriouVolume:
4
Year:
1977
Language:
english
Pages:
8
DOI:
10.1016/0304-3975(77)90012-3
File:
PDF, 918 KB
english, 1977