A Simpler Analysis for -Clairvoyant Flow Time Scheduling
Abstract
We simplify the proof of the optimality of the Shortest Lower-Bound First (SLF) algorithm, introduced by Gupta, Kaplan, Lindermayr, Schl\"oter, and Yingchareonthawornchai [FOCS'25], for minimizing the total flow time in the -clairvoyant setting.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.