Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms
From MaRDI portal
Publication:4554950
DOI10.1145/3155297zbMath1421.68242OpenAlexW2780261041MaRDI QIDQ4554950
Nikhil R. Devanur, Zhi-Yi Huang
Publication date: 12 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3155297
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (2)
An Optimal Control Framework for Online Job Scheduling with General Cost Functions ⋮ 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
