Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs

Consider the following restricted (symmetric or asymmetric) traveling-salesman problem (TSP): given an initial ordering of then cities and an integerk > 0, find a minimum-cost feasible tour, where ...