Browsing by Subject "Unsplittable flow on a path"
Now showing items 1-1 of 1
-
(Association for Computing Machinery, 2018)In the unsplittable flow on a path problem (UFP) we are given a path with edge capacities and a collection of tasks. Each task is characterized by a subpath, a profit, and a demand. Our goal is to compute a maximum ...