Dantzig ( Maximum Flow)
Jump to navigation
Jump to search
Time Complexity
$O(V^{2}EU)$
Space Complexity
$O(VE)$? words
(Assuming this is referring to translating maximum flow into linear programming and using the simplex algorithm, this requires $O(VE)$ space.)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1951