Extends iterated rounding with matching polyhedra to general graph scheduling for an essentially tight (2+ε)-approximation in the asymptotic regime, improving data migration bounds.
Incremental time-slot assignment in
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
-
Graph Scheduling with Group Completion Times
Extends iterated rounding with matching polyhedra to general graph scheduling for an essentially tight (2+ε)-approximation in the asymptotic regime, improving data migration bounds.