16.0DSMar 18
A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time SchedulingAnupam Gupta, Haim Kaplan, Alexander Lindermayr et al.
We simplify the proof of the optimality of the Shortest Lower-Bound First (SLF) algorithm, introduced by Gupta, Kaplan, Lindermayr, Schlöter, and Yingchareonthawornchai [FOCS'25], for minimizing the total flow time in the $\varepsilon$-clairvoyant setting.