A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
In this paper, we present a constant-factor approximation algorithm for the unsplittable flow problem on a path. This improves on the previous best known approximation factor of O(log n). The approximation ratio of our algorithm is 7+e for any e>;0. In the unsplittable flow problem on a path, we are …