Approximate majorization and fair online load balancing

DOI10.1145/1103963.1103970zbMATH Open1321.90054OpenAlexW1976665334MaRDI QIDQ2944501FDOQ2944501

Authors: Ashish Goel, Adam Meyerson, Serge Plotkin 

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1103963.1103970

Recommendations

• Approximate majorization and fair online load balancing
• Resource augmentation in load balancing.
• Fair online load balancing
• Ancient and new algorithms for load balancing in the \(\ell_p\) norm
• scientific article; zbMATH DE number 2038778

zbMATH Keywords

fairnessload balancing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (9)

• Fair online load balancing
• Simultaneous approximation ratios for parallel machine scheduling problems
• Online load balancing on uniform machines with limited migration
• Price-based protocols for fair resource allocation, convergence time analysis and extension to Leontief utilities
• Title not available (Why is that?)
• Simultaneous optimization via approximate majorization for concave profits or convex costs
• Approximate majorization and fair online load balancing
• Title not available (Why is that?)
• Competitive analysis of the online inventory problem

This page was built for publication: Approximate majorization and fair online load balancing

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