Yin Tat Lee
Satish Rao
ABSTRACT
We give an algorithm which computes a (1-ε)-approximately maximum st-flow in an undirected uncapacitated graph in time O(1/ε√m/F⋅ m log2 n) where F is the flow value. By trading this off against the Karger-Levine algorithm for undirected graphs which takes ~O(m+nF) time, we obtain a running time of ~O(m n1/3/ε2/3) for uncapacitated graphs, improving the previous best dependence on ε by a factor of O(1/ε3). Like the algorithm of Christiano, Kelner, Madry, Spielman and Teng, our algorithm reduces the problem to electrical flow computations which are carried out in linear time using fast Laplacian solvers. However, in contrast to previous work, our algorithm does not reweight the edges of the graph in any way, and instead uses local (i.e., non s-t) electrical flows to reroute the flow on congested edges. The algorithm is simple and may be viewed as trying to find a point at the intersection of two convex sets (the affine subspace of st-flows of value F and the l∞ ball) by an accelerated version of the method of alternating projections due to Nesterov.
By combining this with Ford and Fulkerson's augmenting paths algorithm, we obtain an exact algorithm with running time ~O(m5/4 F1/4) for uncapacitated undirected graphs, improving the previous best running time of ~O(m+ min(nF,m3/2)).
We give a related algorithm with the same running time for approximate minimum cut, based on minimizing a smoothed version of the l1 norm inside the cut space of the input graph. We show that the minimizer of this norm is related to an approximate blocking flow and use this to give an algorithm for computing a length k approximately blocking flow in time ~O(m √k).
- S. Arora, E. Hazan, and S. Kale. The multiplicative weights update method: A meta-algorithm and applications. Theory OF Computing, 8:121--164, 2012.Google Scholar
Cross Ref
- D. Bienstock and G. Iyengar. Solving fractional packing problems in o ast (1/ε) iterations. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 146--155. ACM, 2004. Google ScholarDigital Library
- P. Christiano, J.A. Kelner, A. Madry, D.A. Spielman, and S.H. Teng. Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. In STOC 2011, pages 273--282. ACM, 2011. Google ScholarDigital Library
- A. d'Aspremont. Smooth optimization with approximate gradient. SIAM Journal on Optimization, 19(3):1171--1183, 2008. Google ScholarDigital Library
- S.I. Daitch and D.A. Spielman. Faster approximate lossy generalized flow via interior point algorithms. In Proceedings of the 40th annual ACM symposium on Theory of computing, pages 451--460. ACM, 2008. Google ScholarDigital Library
- L.R. Ford and D.R. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8(3):399--404, 1956.Google ScholarCross Ref
- A. Goel, M. Kapralov, S. Khanna. Perfect matchings in o (n log n) time in regular bipartite graphs In Proceedings of the 42th annual ACM symposium on Theory of computing, pages 39--46. ACM, 2010. Google ScholarDigital Library
- A. Goldberg. Recent developments in maximum flow algorithms. Algorithm Theory SWAT'98, pages 1--10, 1998. Google ScholarDigital Library
- Andrew V. Goldberg and Satish Rao. Beyond the flow decomposition barrier. J. ACM, 45(5):783--797, 1998. Google ScholarDigital Library
- David R. Karger. Better random sampling algorithms for flows in undirected graphs. In SODA, pages 490--499, 1998. Google ScholarDigital Library
- David R. Karger and Matthew S. Levine. Random sampling in residual graphs. In STOC 2002, pages 63--66. ACM, 2002. Google ScholarDigital Library
- I. Koutis, G.L. Miller, and R. Peng. A nearly-m log n time solver for sdd linear systems. In Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on, pages 590--598. IEEE, 2011. Google ScholarDigital Library
- P. Klein and N. Young. On the number of iterations for dantzig-wolfe optimization and packing-covering approximation algorithms. Integer Programming and Combinatorial Optimization, pages 320--327, 1999. Google ScholarDigital Library
- Y. Nesterov. Smooth minimization of non-smooth functions. Mathematical Programming, 103(1):127--152, 2005. Google ScholarDigital Library
- B.T. Poljak. Introduction to optimization. Optimization Software, 1987.Google Scholar
- D.D. Sleator and R. Endre Tarjan. A data structure for dynamic trees. Journal of computer and system sciences, 26(3):362--391, 1983. Google ScholarDigital Library
- Nisheeth Vishnoi. Lx=b, book manuscript.Google Scholar
Index Terms
- A new approach to computing maximum flows using electrical flows
Recommendations
Single Source -- All Sinks Max Flows in Planar Digraphs
FOCS '12: Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer ScienceLet $G = (V, E)$ be a planar $n$-vertex digraph. Consider the problem of computing max $st$-flow values in $G$ from a fixed source $s$ to all sinks $t \in V \set minus \{s\}$. We show how to solve this problem in near-linear $O(n \log^3 n)$ time. ...
Homology Flows, Cohomology Cuts
† Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009)We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus $g$, with two specified vertices $s$ and $t$ and integer edge capacities that sum to $C$, ...
Max Flows in Planar Graphs with Vertex Capacities
We consider the maximum flow problem in directed planar graphs with capacities on both vertices and arcs and with multiple sources and sinks. We present three algorithms when the capacities are integers. The first algorithm runs in O(min {k2 n, n log3 n + ...
Comments