Develops a learning-augmented polynomial-time algorithm for R||C_max that achieves (1+ε)-approximation under accurate predictions of heavy job assignments and falls back to 2-approximation otherwise.
Fanjul-Peyro, L
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 Approximation for Unrelated-Machines Makespan Scheduling
Develops a learning-augmented polynomial-time algorithm for R||C_max that achieves (1+ε)-approximation under accurate predictions of heavy job assignments and falls back to 2-approximation otherwise.