Local search breaks 1.75 for graph balancing
From MaRDI portal
Publication:5091233
Recommendations
- Graph balancing: a special case of scheduling unrelated parallel machines
- A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges
- Graph balancing with orientation costs
- A 3/2-approximation algorithm for the graph balancing problem with two weights
- On the Configuration-LP for Scheduling on Unrelated Machines
Cites work
- A 3/2-approximation algorithm for the graph balancing problem with two weights
- A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges
- A quasi-polynomial approximation for the restricted assignment problem
- Approximation algorithms for scheduling unrelated parallel machines
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
- Combinatorial algorithm for restricted max-min fair allocation
- Compact LP relaxations for allocation problems
- Estimating the makespan of the two-valued restricted assignment problem
- Graph balancing: a special case of scheduling unrelated parallel machines
- On allocating goods to maximize fairness
- On some special cases of the restricted assignment problem
- On the configuration-LP for scheduling on unrelated machines
- On the configuration-LP of the restricted assignment problem
- Quasi-polynomial local search for restricted max-min fair allocation
- Santa claus meets hypergraph matchings
- The Santa Claus problem
Cited in
(3)
This page was built for publication: Local search breaks 1.75 for graph balancing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091233)
