2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DS2024
Improved FPT Approximation for Non-metric TSP
Evripidis Bampis, Bruno Escoffier, Michalis Xefteris
In the Traveling Salesperson Problem (TSP) we are given a list of locations and the distances between each pair of them. The goal is to find the shortest possible tour that visits…
cs.DS2023★ 2 cited
Learning-Augmented Online TSP on Rings, Trees, Flowers and (almost) Everywhere Else
Evripidis Bampis, Bruno Escoffier, Themis Gouleakis +4
We study the Online Traveling Salesperson Problem (OLTSP) with predictions. In OLTSP, a sequence of initially unknown requests arrive over time at points (locations) of a metric sp…
cs.DS2023
The Covering Canadian Traveller Problem Revisited
Niklas Hahn, Michalis Xefteris
In this paper, we consider the -Covering Canadian Traveller Problem (-CCTP), which can be seen as a variant of the Travelling Salesperson Problem. The goal of -CCTP is fin…