Graph balancing with orientation costs
From MaRDI portal
Publication:5075832
DOI10.4230/LIPICS.ESA.2019.82MaRDI QIDQ5075832FDOQ5075832
Authors: Roy Schwartz, Ran Yeheskel 
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/2106.05939
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
- The design of approximation algorithms
- An approximation algorithm for the generalized assignment problem
- Graph balancing: a special case of scheduling unrelated parallel machines
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- Approximation algorithms for scheduling unrelated parallel machines
- The Santa Claus problem
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Title not available (Why is that?)
- On the configuration-LP for scheduling on unrelated machines
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- On the configuration-LP of the restricted assignment problem
- A 3/2-approximation algorithm for the graph balancing problem with two weights
- Estimating the makespan of the two-valued restricted assignment problem
- A Combinatorial Approximation Algorithm for Graph Balancing with Light Hyper Edges
- On some special cases of the restricted assignment problem
- Compact LP relaxations for allocation problems
Cited In (1)
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)
