Defines edge frequencies over optimal i-paths in K_n to characterize OHC edges and gives a DP algorithm for exact TSP in O(n² i_d⁴ 2^{i_d}) time with i_d = O(n^{4/7}).
Dynamic programming treatment of the travelling salesman problem.Journal of the ACM (JACM), 1962, 9(1), 61–63
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The frequency $K_i$s for symmetrical traveling salesman problem
Defines edge frequencies over optimal i-paths in K_n to characterize OHC edges and gives a DP algorithm for exact TSP in O(n² i_d⁴ 2^{i_d}) time with i_d = O(n^{4/7}).