加入
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.
PR
PR 把工作从一条路线带到另一条；合并它就是采纳。
没有开放的 PR
PR 把工作从一个分支带到另一个分支。