加入
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.
+26 −0 scienceslack.json 新增 查看文件
| @@ -0,0 +1,26 @@ | ||
| 1 | +{ | |
| 2 | + "domain": "computer-science", | |
| 3 | + "topics": [ | |
| 4 | + "computational-geometry", | |
| 5 | + "algorithms-complexity" | |
| 6 | + ], | |
| 7 | + "type": "proof", | |
| 8 | + "also": [ | |
| 9 | + "algorithm" | |
| 10 | + ], | |
| 11 | + "cover": { | |
| 12 | + "motif": "points", | |
| 13 | + "n": 8 | |
| 14 | + }, | |
| 15 | + "source": { | |
| 16 | + "key": "topp", | |
| 17 | + "name": "The Open Problems Project", | |
| 18 | + "url": "https://topp.openproblem.net/p49", | |
| 19 | + "id": "49", | |
| 20 | + "curator": "Erik D. Demaine, Joseph S. B. Mitchell and Joseph O'Rourke", | |
| 21 | + "poser": "Alexander Barvinok; Sándor P. Fekete (NP-hardness conjecture)", | |
| 22 | + "status": "open", | |
| 23 | + "as_of": "2026-10-20", | |
| 24 | + "catalog": "0521c19bbd38" | |
| 25 | + } | |
| 26 | +} | |