On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem

Isja Mannens, Jesper Nederlof, Céline Swennenhuis +1

We study a variant of Min Cost Flow in which the flow needs to be connected. Specifically, in the Connected Flow problem one is given a directed graph $G$, along with a set of dema…