Year: 2023
Type: preprint
Abstract: This paper examines the Balanced Submodular Flow Problem, that is the problem of finding a feasible submodular flow minimizing the difference between the flow values along the edges. A min-max formula is given to the problem and an algorithm is presented to solve it using $O(m^2)$ submodular function minimizations. Then, these result are extended to the weighted version of the problem. Finally, the Balanced Integer Submodular Flow Problem is discussed.
Source: arXiv (Cornell University)
Authors: Jüttner, Alpár, Szabó, Eszter
Institution: Eötvös Loránd University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G4171720266, G6451815564
OpenAlex ID: W4386185001
