Balancing congestion for unsplittable routing on a bidirected ring
classification
💻 cs.NI
keywords
alphaapproximationbidirectedproblemringroutingunsplittablealgorithm
read the original abstract
Given a bidirected ring with capacities and a demand graph, we present an approximation algorithm to the problem of finding the minimum $\alpha$ such that there exists a feasible unsplittable routing of the demands after multiplying each capacity by $\alpha$. We also give an approximation scheme to the problem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.