Balancing congestion for unsplittable routing on a bidirected ring
Clinical Orthopaedics and Related Research(2010)
摘要
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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要