A fast maximum flow algorithm
Name
1910.04848.pdf
Description
Submitted version
Size
630.97 KB
Format
Adobe PDF
Checksum (MD5)
e998d920f36c59d8f9b8939ffd2ed55a
Author(s)
Orlin, James B
Gong, Xiao-yue
Date Issued
2021
Journal
Networks
Publisher
Wiley
Version
Original manuscript
Abstract
© 2020 Wiley Periodicals LLC. In 2013, Orlin proved that the max flow problem could be solved in O(nm) time. His algorithm ran in O(nm + m1.94) time, which was the fastest for graphs with fewer than n1.06 arcs. If the graph was not sufficiently sparse, the fastest running time was an algorithm due to King, Rao, and Tarjan. We describe a new variant of the excess scaling algorithm for the max flow problem whose running time strictly dominates the running time of the algorithm by King et al. For graphs in which m = O(nlog n), the running time of our algorithm dominates that of King et al. by a factor of O(loglog n). Moreover, our algorithm achieves this improved performance without reliance on dynamic trees.
MIT Department
Sloan School of Management
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1002/net.22001
