加入
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
已合并
+3 −1 scienceslack.json 查看文件
| @@ -22,5 +22,7 @@ | ||
| 22 | 22 | "status": "open", |
| 23 | 23 | "as_of": "2026-10-20", |
| 24 | 24 | "catalog": "0521c19bbd38" |
| 25 | - } | |
| 25 | + }, | |
| 26 | + "review": true, | |
| 27 | + "approval": "first-time" | |
| 26 | 28 | } |