A black-box method converts any approximation algorithm into a learning-augmented one with a smooth trade-off between prediction error and solution quality, with matching lower bounds.
Distortion-oblivious algorithms for minimizing flow time
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Approximation Algorithms for Combinatorial Optimization with Predictions
A black-box method converts any approximation algorithm into a learning-augmented one with a smooth trade-off between prediction error and solution quality, with matching lower bounds.