Time- and space-optimal algorithms for the many-visits TSP

04/17/2018
by   Andre Berger, et al.
0

The many-visits traveling salesperson problem (MV-TSP) asks for an optimal tour of n cities that visits each city c a prescribed number k_c of times. Travel costs may not be symmetric, and visiting a city twice in a row may incur a non-zero cost. The MV-TSP problem finds applications in scheduling, geometric approximation, and Hamiltonicity of certain graph families. The fastest known algorithm for MV-TSP is due to Cosmadakis and Papadimitriou (SICOMP, 1984). It runs in time n^O(n) + O(n^3 ∑_c k_c ) and requires n^Ω(n) space. The interesting feature of the Cosmadakis-Papadimitriou algorithm is its logarithmic dependence on the total length ∑_c k_c of the tour, allowing the algorithm to handle instances with very long tours, beyond what is tractable in the standard TSP setting. However, the superexponential dependence on the number of cities in both its time and space complexity renders the algorithm impractical for all but the narrowest range of this parameter. In this paper we significantly improve on the Cosmadakis-Papadimitriou algorithm, giving an MV-TSP algorithm that runs in single-exponential time with polynomial space. More precisely, we obtain the running time 2^O(n) + O(n^3 ∑_c k_c), with O(n^2 ∑_c k_c) space. Assuming the Exponential-time Hypothesis (ETH), both the time and space requirements of our algorithm are optimal. Our algorithm is deterministic, and arguably both simpler and easier to analyse than the original approach of Cosmadakis and Papadimitriou. It involves an optimization over oriented spanning trees of a graph and employs a recursive, centroid-based decomposition of trees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/05/2020

Many visits TSP revisited

We study the Many Visits TSP problem, where given a number k(v) for each...
research
05/05/2022

Computing treedepth in polynomial space and linear fpt time

The treedepth of a graph G is the least possible depth of an elimination...
research
01/30/2019

Computing runs on a trie

A maximal repeat, or run, in a string, is a periodically maximal substri...
research
11/19/2020

Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees

We consider the problem of computing the diameter of a unicycle graph (i...
research
01/31/2019

Reachability in High Treewidth Graphs

Reachability is the problem of deciding whether there is a path from one...
research
08/04/2016

A Polynomial-Time Deterministic Approach to the Traveling Salesperson Problem

We propose a new polynomial-time deterministic algorithm that produces a...
research
06/08/2020

A New Integer Programming Formulation of the Graphical Traveling Salesman Problem

In the Traveling Salesman Problem (TSP), a salesman wants to visit a set...

Please sign up or login with your details

Forgot password? Click here to reset