Kathuria, Liu, Sidford ( Maximum Flow)

From Algorithm Wiki
Revision as of 08:53, 10 April 2023 by Admin (talk | contribs)
Jump to navigation Jump to search

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.ezproxy.canberra.edu.au/doi/abs/10.1137/20M1383525