3 papers
cs.DS2026
Approximation Algorithms for Graphic Multi-Depot TSP and Graphic Multi-Path TSP
Niklas Dahlmeier, Raoul Luqué, Philipp Pabst +1
We give improved approximation algorithms for two graphic TSP variants. First, we consider Multi-Depot TSP on graphic instances. In this variant, we are given an undirected graph w…
cs.DS2025
Low Recourse Arborescence Forests Under Uniformly Random Arcs
J Niklas Dahlmeier, D Ellis Hershkowitz
In this work, we study how to maintain a forest of arborescences of maximum arc cardinality under arc insertions while minimizing recourse -- the total number of arcs changed in th…
cs.DS2025
Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
Morteza Alimi, Niklas Dahlmeier, Tobias Mömke +2
The path version of the Traveling Salesman Problem is one of the most well-studied variants of the ubiquitous TSP. Its generalization, the Multi-Path TSP, has recently been used in…