Simpler and Better Algorithms for Minimum-Norm Load Balancing
From MaRDI portal
Recommendations
Cites work
- A Best Possible Heuristic for the k-Center Problem
- A constant-factor approximation algorithm for the k-median problem
- A unified approach to scheduling on unrelated parallel machines
- All-norm approximation algorithms
- An approximation algorithm for the generalized assignment problem
- 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
- Approximation algorithms for minimum norm and ordered optimization problems
- Approximation algorithms for scheduling unrelated parallel machines
- Approximation schemes for scheduling on parallel machines
- Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
- Constant-factor approximation for ordered k-median
- Convex programming for scheduling unrelated parallel machines
- Geometric algorithms and combinatorial optimization
- Graph balancing: a special case of scheduling unrelated parallel machines
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- Interpolating between \(k\)-median and \(k\)-center: approximation algorithms for ordered \(k\)-median
- Location science
- Location theory. A unified approach
- On (1,)-restricted assignment makespan minimization
- On the configuration-LP of the restricted assignment problem
- Simultaneous optimization via approximate majorization for concave profits or convex costs
- Solving Optimization Problems with Diseconomies of Scale via Decoupling
Cited in
(4)
This page was built for publication: Simpler and Better Algorithms for Minimum-Norm Load Balancing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075764)
