| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429118 | Information Processing Letters | 2009 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
