<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2013-04-08 19:53:37Operations research Combinatorial optimization Maximum flow problem Gradient descent Flow network Graph Max-flow min-cut theorem Lipschitz continuity Function Mathematics Numerical analysis Network flow |
|
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations Jonathan A. Kelner