Balancing congestion for unsplittable routing on a bidirected ring

TL;DR

This paper introduces approximation algorithms for optimizing unsplittable routing on bidirected rings, aiming to find minimal capacity scaling factors to satisfy demand constraints.

Contribution

It presents the first approximation algorithm and an approximation scheme for the problem of balancing congestion in unsplittable routing on bidirected rings.

Findings

Approximation algorithm for minimal capacity scaling factor

Approximation scheme for the problem

Feasible unsplittable routing solutions

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.