2 citations · 2 across the 3 of their papers we have counts for
3 papers
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…
Resource Leveling: Complexity of a UET two-processor scheduling variant and related problems
Pascale Bendotti, Luca Brunod Indrigo, Philippe Chrétienne +1
This paper mainly focuses on a resource leveling variant of a two-processor scheduling problem. The latter problem is to schedule a set of dependent UET jobs on two identical proce…
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…