Lee, Sidford ( Maximum Flow)
Jump to navigation
Jump to search
Time Complexity
$O(E*sqrt(V)$*log^{2}(U)*polylog(E, V, log(U))
Space Complexity
$O(E)$ words
((derived in notes))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2014
Reference
https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6979027