Sciweavers

Share
CORR
2010
Springer

Balancing congestion for unsplittable routing on a bidirected ring

9 years 1 months ago
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.
Johanna Becker, Zsolt Csizmadia, Alexandre Laugier
Added 01 Mar 2011
Updated 01 Mar 2011
Type Journal
Year 2010
Where CORR
Authors Johanna Becker, Zsolt Csizmadia, Alexandre Laugier, Jácint Szabó, László Szegö
Comments (0)
books