Simpler and Better Algorithms for Minimum-Norm Load Balancing
From MaRDI portal
Publication:5075764
DOI10.4230/LIPIcs.ESA.2019.27OpenAlexW2978210152MaRDI QIDQ5075764
Deeparnab Chakrabarty, Chaitanya Swamy
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1905.00044
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Geometric algorithms and combinatorial optimization
- Approximation schemes for scheduling on parallel machines
- An approximation algorithm for the generalized assignment problem
- A constant-factor approximation algorithm for the \(k\)-median problem
- Graph balancing: a special case of scheduling unrelated parallel machines
- Simultaneous optimization via approximate majorization for concave profits or convex costs
- Location Theory
- A unified approach to scheduling on unrelated parallel machines
- An approximation scheme for stochastic linear programming and its application to stochastic integer programs
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Convex programming for scheduling unrelated parallel machines
- A Best Possible Heuristic for the k-Center Problem
- On the Configuration-LP of the Restricted Assignment Problem
- Solving Optimization Problems with Diseconomies of Scale via Decoupling
- All-norm approximation algorithms
- Santa Claus Schedules Jobs on Unrelated Machines
- Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
- Approximation algorithms for minimum norm and ordered optimization problems
- Constant-factor approximation for ordered k-median
- Location Science
- On (1,∊)-Restricted Assignment Makespan Minimization
This page was built for publication: Simpler and Better Algorithms for Minimum-Norm Load Balancing
