A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths

@article{Bonsma2011ACF,
  title={A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths},
  author={Paul S. Bonsma and Jens Schulz and Andreas Wiese},
  journal={2011 IEEE 52nd Annual Symposium on Foundations of Computer Science},
  year={2011},
  pages={47-56}
}
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 given a capacitated path P and n tasks, each task having a demand, a profit, and start and end vertices. The goal is to compute a maximum profit set of tasks, such that for each edge e of P, the… CONTINUE READING
Highly Cited
This paper has 63 citations. REVIEW CITATIONS

6 Figures & Tables

Topics

Statistics

0510152009201020112012201320142015201620172018
Citations per Year

63 Citations

Semantic Scholar estimates that this publication has 63 citations based on the available data.

See our FAQ for additional information.