Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Graph balancing: a special case of scheduling unrelated parallel machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
An optimal rounding gives a better approximation for scheduling unrelated machines
Operations Research Letters
On the configuration-LP for scheduling on unrelated machines
ESA'11 Proceedings of the 19th European conference on Algorithms
| Hi-index | 0.89 |
We consider the graph balancing problem of providing orientations to edges in an undirected multi-graph to minimize the maximum load. We first obtain an FPTAS when the multi-graph is restricted to a tree. We also obtain some additional results for other restricted cases by showing equivalencies with related combinatorial problems.