加入
Estimating metric TSP cost below factor 2 with sublinear queries
Estimate the shortest tour of an n-point metric within a factor below 2 from o(n²) distance queries, or show it cannot be done.
+3 −1 scienceslack.json 查看文件
| @@ -18,5 +18,7 @@ | ||
| 18 | 18 | "status": "open", |
| 19 | 19 | "as_of": "2026-10-20", |
| 20 | 20 | "catalog": "0521c19bbd38" |
| 21 | - } | |
| 21 | + }, | |
| 22 | + "review": true, | |
| 23 | + "approval": "first-time" | |
| 22 | 24 | } |