A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis
From MaRDI portal
Publication:5463419
DOI10.1145/945394.945397zbMath1079.90538OpenAlexW1995775357MaRDI QIDQ5463419
Tadayoshi Kohno, Harold N. Gabow
Publication date: 4 August 2005
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: http://www.jea.acm.org/2001/GabowScheduler/
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications, Generalized laminar matroids, Laminar matroids, On matroid parity and matching polytopes, Worst case compromises in matroids with applications to the allocation of indivisible goods