The Complexity of Scheduling for p-Norms of Flow and Stretch

DOI10.1007/978-3-642-36694-9_24zbMath1372.90051OpenAlexW1532443211MaRDI QIDQ4910823

Benjamin Moseley, Clifford Stein, Kirk R. Pruhs

Publication date: 19 March 2013

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36694-9_24

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

The efficiency-fairness balance of round robin scheduling ⋮ Fair Scheduling via Iterative Quasi-Uniform Sampling

This page was built for publication: The Complexity of Scheduling for p-Norms of Flow and Stretch