Algorithms and Complexity for the Almost Equal Maximum Flow Problem

Rebekka Haese, Till Heller, Sven O. Krumke

In the Equal Maximum Flow Problem (EMFP), we aim for a maximum flow where we require the same flow value on all edges in some given subsets of the edge set. In this paper, we study…