First learning-augmented algorithms for online minimization problems that use stable dual LP predictions to improve theoretical guarantees on metrical task systems and laminar set cover.
50th International Colloquium on Automata, Languages, and Programming,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Learning-Augmented Online Minimization with Dual Predictions
First learning-augmented algorithms for online minimization problems that use stable dual LP predictions to improve theoretical guarantees on metrical task systems and laminar set cover.