Algorithms and complexity for the almost equal maximum flow problem

DOI10.1007/978-3-030-48439-2_39zbMath1476.90339arXiv2104.05288OpenAlexW3089034870MaRDI QIDQ2050270

T. Heller, Sven O. Krumke, R. Haese

Publication date: 30 August 2021

Full work available at URL: https://arxiv.org/abs/2104.05288

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

This page was built for publication: Algorithms and complexity for the almost equal maximum flow problem