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.
PR
PR 把工作从一条路线带到另一条;合并它就是采纳。
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.
PR 把工作从一条路线带到另一条;合并它就是采纳。