On the NP-hardness of speed scaling with sleep state
From MaRDI portal
Publication:495994
DOI10.1016/j.tcs.2015.06.012zbMath1329.68127arXiv1304.7373OpenAlexW844564591MaRDI QIDQ495994
Saswata Shannigrahi, Gunjan Kumar
Publication date: 16 September 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.7373
Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
A greedy approximation algorithm for minimum-gap scheduling ⋮ A fully polynomial-time approximation scheme for speed scaling with a sleep state
Cites Work
This page was built for publication: On the NP-hardness of speed scaling with sleep state