Balancing congestion for unsplittable routing on a bidirected ring
Networking and Internet Architecture
2010-06-03 v2
Abstract
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.
Cite
@article{arxiv.1006.0193,
title = {Balancing congestion for unsplittable routing on a bidirected ring},
author = {Johanna Becker and Zsolt Csizmadia and Alexandre Laugier and Jácint Szabó and László Szegö},
journal= {arXiv preprint arXiv:1006.0193},
year = {2010}
}