Abstract
The Max-Flow Min-Cut theorem is the classical duality result for the Max-Flow problem, which considers flow of a single commodity. We study a multiple commodity generalization of Max-Flow in which flows are composed of real-valued k-vectors through networks with arc capacities formed by regions in \(\mathbb {R}^k\). Given the absence of a clear notion of ordering in the multicommodity case, we define the generalized max flow as the feasible region of all flow values. We define a collection of concepts and operations on flows and cuts in the multicommodity setting. We study the mutual capacity of a set of cuts, defined as the set of flows that can pass through all cuts in the set. We present a method to calculate the mutual capacity of pairs of cuts, and then generalize the same to a method of calculation for arbitrary sets of cuts. We show that the mutual capacity is exactly the set of feasible flows in the network, and hence is equal to the max flow. Furthermore, we present a simple class of the multicommodity max flow problem where computations using this tight duality result could run significantly faster than default brute force computations. We also study more tractable special cases of the multicommodity max flow problem where the objective is to transport a maximum real or integer multiple of a given vector through the network. We devise an augmenting cycle search algorithm that reduces the optimization problem to one with m constraints in at most \(\mathbb {R}^{(m-n+1)k}\) space from one that requires mn constraints in \(\mathbb {R}^{mk}\) space for a network with n nodes and m edges. We present efficient algorithms that compute \(\epsilon \)-approximations to both the ratio and the integer ratio maximum flow problems.
Similar content being viewed by others
Data Availability
There are no datasets used. All enquiries about data could still be directed to the authors.
References
Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Pearson, London
Delos V, Teissandier D (2014) Minkowski sum of polytopes defined by their vertices. arXiv:1412.2564
Even S, Itai A, Shamir A (1976) On the complexity of timetable and multicommodity flow problems. SIAM J Comput 5(4):691–703. https://doi.org/10.1137/0205048
Ford LR Jr, Fulkerson DR (1956) Maximal flow through a network. Can J Math 8:399–404. https://doi.org/10.4153/CJM-1956-045-5
Ghrist R, Krishnan S (2013) A topological max-flow-min-cut theorem. In: 2013 IEEE global conference on signal and information processing (GlobalSIP), pp 815–818. https://doi.org/10.1109/GlobalSIP.2013.6737016
Krishnan S (2021) Flow-cut dualities for sheaves on graphs. https://people.math.osu.edu/krishnan.118/papers/mfmc.pdf, last Accessed 18 Sep 2021
Leighton T, Rao S (1999) Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J ACM 46(6):787–832. https://doi.org/10.1145/331524.331526
nLab authors. Flat Module. http://ncatlab.org/nlab/show/flat+module, March 2021. Revision 29
Acknowledgements
We thank the National Science Foundation for support through Grants 1661348 and 1819229.
Funding
This work was partly supported by the US National Science Foundation (NSF) through grants 1661348 and 1819229.
Author information
Authors and Affiliations
Contributions
The two authors contributed equally to all aspects of the research and manuscript preparation.
Corresponding author
Ethics declarations
Conflict of interest
The authors have no relevant financial or non-financial competing interests to disclose.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Broussard, M., Krishnamoorthy, B. A tight max-flow min-cut duality theorem for nonlinear multicommodity flows. J Comb Optim 47, 54 (2024). https://doi.org/10.1007/s10878-024-01120-2
Accepted:
Published:
DOI: https://doi.org/10.1007/s10878-024-01120-2