# Helsinki Algorithms Seminar: "Improving TSP tours using dynamic programming over tree decompositions" Lukasz Kowalik, University of Warsaw

`2017-11-16 16:15:00``2017-11-16 17:00:00``Europe/Helsinki``Helsinki Algorithms Seminar: "Improving TSP tours using dynamic programming over tree decompositions" Lukasz Kowalik, University of Warsaw``Weekly meeting of researchers in the Helsinki area interested in the art of algorithms and algorithm design http://cs.aalto.fi/en/midcom-permalink-1e7c2f5acc6efaac2f511e7a08a55fdfc075a0d5a0d``Otakaari 2, 02150, Helsinki`Weekly meeting of researchers in the Helsinki area interested in the art of algorithms and algorithm design

Map © OpenStreetMap. Some rights reserved.

Lukasz Kowalik

University of Warsaw

**Improving TSP tours using dynamic programming over tree decompositions**

Abstract:

Given a traveling salesman problem (TSP) tour H in graph G, a k-move is an operation which removes k edges from H, and adds k edges of G so that a new tour H' is formed. The popular k-opt heuristic for TSP finds a local optimum by starting from an arbitrary tour H and then improving it by a sequence of k-moves. Until 2016, the only known algorithm to find an improving k-move for a given tour was the naive solution in time O(n^k). At ICALP'16 de Berg, Buchin, Jansen and Woeginger showed an O(n^{floor(2/3k)+1})-time algorithm.

We show an algorithm which runs in O(n^{(1/4 + epsilon_k)k}) time, where lim_{k -> infinity} epsilon_k = 0. It improves over the state of the art for every k >= 5. For the most practically relevant case k=5 we provide a slightly refined algorithm running in O(n^{3.4}) time. We also show that for the k=4 case, improving over the O(n^3)-time algorithm of de Berg et al. would be a major breakthrough: an O(n^{3 - epsilon})-time algorithm for any epsilon > 0 would imply an O(n^{3 - delta})-time algorithm for the All Pairs Shortest Paths problem, for some delta>0.

**

Helsinki Algorithms Seminar is a weekly meeting of researchers in the Helsinki area interested in the art of algorithms and algorithm design, broadly interpreted to cover both theoretical ideas and algorithm engineering on concrete computing platforms. In most cases we have a presentation prepared for each meeting to communicate an idea, a recent result, work-in-progress, or demo, but this should not be at the expense of discussion and simply having fun with algorithms.

Our affiliations are with Aalto University and the University of Helsinki, and accordingly our activities alternate between the Otaniemi Campus of Aalto University and the Kumpula Campus of University of Helsinki, catalyzed by the Helsinki Institute for Information Technology HIIT, under the Algorithmic Data Analysis (ADA) programme.

Welcome!