2 citations · 2 across the 5 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
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…
cs.DS2022
Online TSP with Known Locations
Evripidis Bampis, Bruno Escoffier, Niklas Hahn +1
In this paper, we consider the Online Traveling Salesperson Problem (OLTSP) where the locations of the requests are known in advance, but not their arrival times. We study both the…