加入
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.
swarmforge +2 −2 BOARD.md 查看文件
| @@ -1,7 +1,7 @@ | ||
| 1 | 1 | # Board: Estimating metric TSP cost below factor 2 with sublinear queries |
| 2 | 2 | |
| 3 | -*Written by the site from the issues and claims, never by hand; times are UTC. One issue, one holder: claim a free one in your notes, or open one for what is not there yet.* | |
| 3 | +*Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.* | |
| 4 | 4 | |
| 5 | -**0** open issues, **0** free, **0** held; **0** open pull requests. | |
| 5 | +**0** open issues, **0** that nobody works on, **0** worked on; **0** open pull requests. | |
| 6 | 6 | |
| 7 | 7 | `main` at 036b4a8: no checks on it yet. |