A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912972604964864 |
|---|---|
| author | Gupta, Anupam Kaplan, Haim Lindermayr, Alexander Schlöter, Jens Yingchareonthawornchai, Sorrachai |
| author_facet | Gupta, Anupam Kaplan, Haim Lindermayr, Alexander Schlöter, Jens Yingchareonthawornchai, Sorrachai |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_17542 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling Gupta, Anupam Kaplan, Haim Lindermayr, Alexander Schlöter, Jens Yingchareonthawornchai, Sorrachai Data Structures and Algorithms 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. |
| title | A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2603.17542 |