Martens, MarenSkutella, Martin2021-12-172021-12-1720082197-8085https://depositonce.tu-berlin.de/handle/11303/15639http://dx.doi.org/10.14279/depositonce-14412Since the seminal work of Ford and Fulkerson in the 1950s, network flow theory is one of the most important and most active areas of research in combinatorial optimization. Coming from the classical maximum flow problem, we introduce and study an apparently basic but new flow problem that features a couple of interesting peculiarities. We derive several results on the complexity and approximability of the new problem. On the way we also discover two closely related basic covering and packing problems that are of independent interest.en510 Mathematiknetwork flowspackingcoveringapproximationResearch Paper