Login / Signup
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
Jonathan A. Kelner
Lorenzo Orecchia
Yin Tat Lee
Aaron Sidford
Published in:
CoRR (2013)
Keyphrases
</>
max flow
undirected graph
min cost
objective function
worst case
dynamic programming
optimal solution
np hard
graph structure
bayesian networks
expectation maximization
convex hull
connected components
globally optimal