activity
20092026
most citedImproved Approximation Algorithms for the Non-preemptive Speed-scaling Problem

3 citations · 8 across the 10 of their papers we have counts for

collaborators
Showing 2023 · cs.DSShow all

1 paper · 2 filters

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…