Login / Signup
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow.
Li Chen
Rasmus Kyng
Yang P. Liu
Richard Peng
Maximilian Probst Gutenberg
Sushant Sachdeva
Published in:
Commun. ACM (2023)
Keyphrases
</>
maximum flow
minimum cost flow
minimum cut
push relabel
computational complexity
dynamic programming
worst case
combinatorial optimization
linear programming
shortest path
directed graph
approximation algorithms
bi objective