A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
SIAM J. Comput., pp. 767-799, 2014.
profitabilitypolynomial timelinear programdata structure
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 e0. In the unsplittable flow problem on a path, we are given a capacitated path P and n tasks, e...More
PPT (Upload PPT)