Kathuria, Liu, Sidford ( Maximum Flow): Difference between revisions
Jump to navigation
Jump to search
(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") |
No edit summary |
||
Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(E^({ | $O(E^({4}/{3}+o({1})$)U^({1}/{3})) | ||
== Space Complexity == | == Space Complexity == | ||
Line 15: | Line 15: | ||
== Approximate? == | == Approximate? == | ||
Exact | |||
== Randomized? == | == Randomized? == |
Revision as of 11:54, 15 February 2023
Time Complexity
$O(E^({4}/{3}+o({1})$)U^({1}/{3}))
Space Complexity
$O(E)$ or $O(V^{2})$ ? words
(unsure, please look)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2020