Balancing congestion for unsplittable routing on a bidirected ring
Becker, Johanna · Csizmadia, Zsolt · Laugier, Alexandre · Szabó, Jácint · Szegö, László
Original · EN
Given a bidirected ring with capacities and a demand graph, we present an approximation algorithm to the problem of finding the minimum α such that there exists a feasible unsplittable routing of the demands after multiplying each capacity by α. We also give an approximation scheme to the problem.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.