2 papers
cs.DS2026
A Simpler Analysis for -Clairvoyant Flow Time Scheduling
Anupam Gupta, Haim Kaplan, Alexander Lindermayr +2
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],…
cs.DS2025
The Online Submodular Cover Problem
Anupam Gupta, Roie Levin
In the submodular cover problem, we are given a monotone submodular function , and we want to pick the min-cost set such that . Motivated by problems in network…