Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms
From MaRDI portal
Publication:5384045
DOI10.1137/1.9781611973402.83zbMath1421.68243OpenAlexW4234053932MaRDI QIDQ5384045
Nikhil R. Devanur, Zhi-Yi Huang
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973402.83
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (8)
Efficient computation of optimal energy and fractional weighted flow trade-off schedules ⋮ On the Complexity of Speed Scaling ⋮ Online covering with \(\ell_q\)-norm objectives and applications to network design ⋮ Unnamed Item ⋮ Energy efficient scheduling of parallelizable jobs ⋮ Welfare maximization with production costs: a primal dual approach ⋮ Approximating \(k\)-forest with resource augmentation: a primal-dual approach ⋮ Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems
This page was built for publication: Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms
