Maximum Flow and Minimum-Cost Flow in Almost-Linear Time.

Li Chen Rasmus Kyng Yang P. Liu Richard Peng Maximilian Probst Gutenberg Sushant Sachdeva

Published in: FOCS (2022)

Keyphrases

maximum flow
minimum cost flow
minimum cut
shortest path
bi objective
directed graph
minimum cost
worst case
shortest path algorithm
push relabel
graph cuts
multi objective
global optimization
optimization algorithm
shortest path problem
upper bound
dynamic programming
pairwise
social networks