加入
The complexity of the longest tour through points in the plane
Determine whether finding the longest tour through n points in the plane, with Euclidean distances, is NP-hard or solvable in polynomial time.
Update from the catalog #1
已合并
Determine whether finding the longest tour through n points in the plane, with Euclidean distances, is NP-hard or solvable in polynomial time.