New approximation schemes for unsplittable flow on a path
SODA, pp. 47-58, 2015.
We study the unsplittable flow on a path problem which has received a lot of attention in the research community recently. Given is a path with capacities on its edges and a set of tasks where each task is characterized by a source and a sink vertex, a demand, and a profit. The goal is to find a subset of the tasks of maximum total profit...More
Get fulltext within 24h
Full Text (Upload PDF)
PPT (Upload PPT)