Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms

DOI10.1137/1.9781611973402.83MaRDI QIDQ5384045zbMATH OpenOpenAlexFDO

Authors Nikhil R. Devanur, Zhiyi 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

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Primal dual gives almost optimal energy-efficient online algorithms
• The Design of Competitive Online Algorithms via a Primal—Dual Approach
• A primal-dual perspective of online learning algorithms
• scientific article; zbMATH DE number 7765403
• Online lower bounds via duality
• Lagrangian duality based algorithms in online energy-efficient scheduling
• Online primal-dual for non-linear optimization with applications to speed scaling
• Online primal-dual algorithms for covering and packing
• Algorithms – ESA 2005

Cited in

(11)

• Energy efficient scheduling of parallelizable jobs
• Online covering with \(\ell_q\)-norm objectives and applications to network design
• Welfare maximization with production costs: a primal dual approach
• Efficient computation of optimal energy and fractional weighted flow trade-off schedules
• Online primal-dual for non-linear optimization with applications to speed scaling
• Lagrangian duality in online scheduling with resource augmentation and speed scaling
• On the complexity of speed scaling
• Primal dual gives almost optimal energy-efficient online algorithms
• Lagrangian duality based algorithms in online energy-efficient scheduling
• Approximating \(k\)-forest with resource augmentation: a primal-dual approach
• scientific article; zbMATH DE number 7765403 (Why is no real title available?)

This page was built for publication: Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384045)