pith. sign in

Select and permute:

Khuller, Samir, Li, Jingling, Sturmfels, Pascal, Sun, Kevin, Venkat, Prayaag , year = · 2019 · DOI 10.1016/j.tcs.2019.07.026

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

fields

cs.DS 1

years

2026 1

verdicts

UNVERDICTED 1

clear filters

representative citing papers

Graph Scheduling with Group Completion Times

cs.DS · 2026-06-30 · unverdicted · novelty 7.0

Extends iterated rounding with matching polyhedra to general graph scheduling for an essentially tight (2+ε)-approximation in the asymptotic regime, improving data migration bounds.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • Graph Scheduling with Group Completion Times cs.DS · 2026-06-30 · unverdicted · none · ref 35

    Extends iterated rounding with matching polyhedra to general graph scheduling for an essentially tight (2+ε)-approximation in the asymptotic regime, improving data migration bounds.