Balancing congestion for unsplittable routing on a bidirected ring
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.