Algorithms and complexity for the almost equal maximum flow problem

In the equal maximum flow problem (EMFP), we aim for a maximum flow where we require the same flow value on all arcs in some given subsets of the arc set, so called homologous arc sets. In this article, we study the closely related almost equal maximum flow problems (AEMFP) where the flow values on...

Full description

Saved in:

Bibliographic Details
Published in:	Networks Vol. 83; no. 4; pp. 642 - 652
Main Authors:	Haese, Rebekka, Heller, Till, Krumke, Sven O.
Format:	Journal Article
Language:	English
Published:	New York Wiley Subscription Services, Inc 01.06.2024
Subjects:	Algorithms Deviation Homology Mathematical analysis Polynomials
ISSN:	0028-3045, 1097-0037
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!