  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 be asymmetric, 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 \log \sum_c k_c )$ and
requires $n^{\Theta(n)}$ space. An interesting feature of the
Cosmadakis-Papadimitriou algorithm is its \emph{logarithmic} dependence on the
total length $\sum_c k_c$ of the tour, allowing the algorithm to handle
instances with very long tours. The \emph{superexponential} dependence on the
number of cities in both the time and space complexity, however, renders the
algorithm impractical for all but the narrowest range of this parameter.
  In this paper we improve upon the Cosmadakis-Papadimitriou algorithm, giving
an MV-TSP algorithm that runs in time $2^{O(n)}$, i.e.\
\emph{single-exponential} in the number of cities, using \emph{polynomial}
space. 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 directed spanning trees and a recursive, centroid-based
decomposition of trees.
