Login / Signup
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations.
Jonathan A. Kelner
Yin Tat Lee
Lorenzo Orecchia
Aaron Sidford
Published in:
SODA (2014)
Keyphrases
</>
max flow
undirected graph
dynamic programming
worst case
np hard
objective function
optimal solution
computational complexity
network flow
probabilistic model
linear programming
expectation maximization
tree structure
graph structure
globally optimal
min cost