Optimization Online


A Fast Max Flow Algorithm

James Orlin(jorlin***at***mit.edu)
Xiao-Yue Gong(xygong***at***mit.edu)

Abstract: In 2013, Orlin proved that the max flow problem could be solved in $O(nm)$ time. His algorithm ran in $O(nm + m^{1.94})$ time, which was the fastest for graphs with fewer than $n^{1.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. Moreover, for graphs in which $m = O(n \log n)$, the running time of our algorithm dominates that of King et al. by a factor of $O(\log\log n)$.

Keywords: max flow, data structures, algorithms

Category 1: Applications -- OR and Management Sciences

Category 2: Network Optimization

Citation: Massachusetts Institute of Technology, October/2019

Download: [PDF]

Entry Submitted: 10/10/2019
Entry Accepted: 10/10/2019
Entry Last Modified: 10/10/2019

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society