The Parameterized Complexity Landscape of the Unsplittable Flow Problem

Robert Ganian, Mathis Rocton, Daniel Unterberger

We study the well-established problem of finding an optimal routing of unsplittable flows in a graph. While by now there is an extensive body of work targeting the problem on graph…