1 paper · 1 filter
Tobias Brunsch, Heiko Röglin, Cyriel Rutten +1
We study popular local search and greedy algorithms for scheduling. The performance guarantee of these algorithms is well understood, but the worst-case lower bounds seem somewhat…