2 papers
cs.DS2026
Delayed-Clairvoyant Flow Time Scheduling via a Borrow Graph Analysis
Alexander Lindermayr, Jens Schlöter
We study the problem of preemptively scheduling jobs online over time on a single machine to minimize the total flow time. In the traditional clairvoyant scheduling model, the sche…
cs.DS2025
Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid
Haya Diwan, Lisa Hellerstein, Nicole Megow +1
Research in explorable uncertainty addresses combinatorial optimization problems where there is partial information about the values of numeric input parameters, and exact values o…