Kathuria, Liu, Sidford ( Maximum Flow)
Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(E^({1}+o({1})$)/sqrt(eps)) == Space Complexity == $O(E)$ or $O(V^{2})$ ? words (unsure, please look) == Description == == Approximate? == Approximate Approximation Factor: 1+eps == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2020 == Reference == https://epubs.siam.org/doi/abs/10.1137/20M1383525")
Time Complexity
$O(E^({1}+o({1})$)/sqrt(eps))
Space Complexity
$O(E)$ or $O(V^{2})$ ? words
(unsure, please look)
Description
Approximate?
Approximate
Approximation Factor: 1+eps
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2020