Algorithms and Complexity for the Almost Equal Maximum Flow Problem

R. Haese, T. Heller () and S. O. Krumke
Additional contact information
R. Haese: University of Kaiserslautern
T. Heller: Fraunhofer ITWM
S. O. Krumke: University of Kaiserslautern

A chapter in Operations Research Proceedings 2019, 2020, pp 323-329 from Springer

Abstract: Abstract 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. We study the related Almost Equal Maximum Flow Problems (AEMFP) where the flow values on arcs of one homologous arc set differ at most by the valuation of a so called homologous function Δ. We prove that the integer AEMFP is in general N P $$\mathcal {N}\mathcal {P}$$ -complete, and that even finding a fractional maximum flow in the case of convex homologous functions is also N P $$\mathcal {N}\mathcal {P}$$ -complete. This is in contrast to the EMFP, which is polynomial time solvable in the fractional case. We also provide inapproximability results for the integral AEMFP. For the integer AEMFP we state a polynomial algorithm for the constant deviation and concave case for a fixed number of homologous sets.

Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-030-48439-2_39

Ordering information: This item can be ordered from
http://www.springer.com/9783030484392

DOI: 10.1007/978-3-030-48439-2_39

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().