An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
In this paper, we introduce a new framework for approximately solving flow problems in capacitated, undirected graphs and apply it to provide asymptotically faster algorithms for the maximum s-t flow and maximum concurrent multicommodity flow problems. For graphs with n vertices and m edges, it allo...
| Main Authors: | , , , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Society for Industrial and Applied Mathematics,
2015-01-15T21:16:29Z.
|
| Subjects: | |
| Online Access: | Get fulltext |