Graph balancing with orientation costs
From MaRDI portal
Publication:5075832
Recommendations
- A note on graph balancing problems with restrictions
- Local search breaks 1.75 for graph balancing
- Graph balancing: a special case of scheduling unrelated parallel machines
- A 3/2-approximation algorithm for the graph balancing problem with two weights
- A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges
Cites work
- scientific article; zbMATH DE number 5764783 (Why is no real title available?)
- 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 Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- An approximation algorithm for the generalized assignment problem
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Approximation algorithms for scheduling unrelated parallel machines
- Compact LP relaxations for allocation problems
- Estimating the makespan of the two-valued restricted assignment problem
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Graph balancing: a special case of scheduling unrelated parallel machines
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- 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
- The Santa Claus problem
- The design of approximation algorithms
This page was built for publication: Graph balancing with orientation costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075832)
