Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms
From MaRDI portal
Publication:5384045
DOI10.1137/1.9781611973402.83zbMATH Open1421.68243OpenAlexW4234053932MaRDI QIDQ5384045FDOQ5384045
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
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
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)
Cited In (11)
- Online primal-dual for non-linear optimization with applications to speed scaling
- On the complexity of speed scaling
- Lagrangian duality based algorithms in online energy-efficient scheduling
- Lagrangian duality in online scheduling with resource augmentation and speed scaling
- 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
- Efficient computation of optimal energy and fractional weighted flow trade-off schedules
- Title not available (Why is that?)
- Primal dual gives almost optimal energy-efficient online algorithms
- Online covering with \(\ell_q\)-norm objectives and applications to network design
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)