Balancing congestion for unsplittable routing on a bidirected ring

Given a bidirected ring with capacities and a demand graph, we present an approximate solution to the problem of nding the minimum such that there exists a feasible routing of the demands after multiplying each capacity by . We also give an approximation scheme to the problem.

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Johanna Becker, Zsolt Csizmadia, Alexandre Laugier, Jácint Szabó, László Szegö
• Keywords: Approximate Solution, CORR 2010, Demand Graph, Education, Feasible Routing