Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back

@article{Madry2013NavigatingCP,
  title={Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back},
  author={Aleksander Madry},
  journal={2013 IEEE 54th Annual Symposium on Foundations of Computer Science},
  year={2013},
  pages={253-262}
}
  • A. Madry
  • Published 8 July 2013
  • Computer Science
  • 2013 IEEE 54th Annual Symposium on Foundations of Computer Science
We present an Õ(m10/7) = Õ(m1.43)-time1 algorithm for the maximum s-t flow and the minimum s-t cut problems in directed graphs with unit capacities. This is the first improvement over the sparse-graph case of the long-standing O(m min{√m, n2/3}) running time bound due to Even and Tarjan [16]. By well-known reductions, this also establishes an Õ(m107)-time algorithm for the maximum-cardinality bipartite matching problem. That, in turn, gives an improvement over the celebrated O(m√n) running… 

Figures from this paper

Computing Maximum Flow with Augmenting Electrical Flows
  • A. Madry
  • Computer Science, Mathematics
    2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2016
TLDR
The presented algorithm takes a primal dual approach in which each iteration uses electrical flows computations both to find an augmenting s-t flow in the current residual graph and to update the dual solution, and shows that by maintain certain careful coupling of these primal and dual solutions the authors are always guaranteed to make significant progress.
Faster Sparse Minimum Cost Flow by Electrical Flow Localization
TLDR
The approach is extending the framework put forth in [Gao-Liu-Peng, 2021] for computing the maximum flow in graphs with large capacities and demonstrates how to reduce the problem of computing an electrical flow to the same problem on a sublinear-sized set of vertices.
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs
TLDR
This work obtains a faster algorithm for solving the minimum cost flow problem in graphs with unit capacity by combining a regularized version of the standard Newton step with a customized preconditioning method which aims to ensure that the graph on which these circulations are computed has sufficiently large conductance.
Unit Capacity Maxflow in Almost O(m) Time
We present an algorithm, which given any m-edge n-vertex directed graph with positive integer capacities at most U computes a maximum s-t flow for any vertices s and t in O(mU) time. This improves
Faster energy maximization for faster maximum flow
TLDR
An algorithm which given any m-edge n-vertex directed graph with integer capacities at most U computes a maximum s-t flow for any vertices s and t in m 11/8+o(1) U 1/4 time with high probability.
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
TLDR
This work introduces a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph and develops the fastest known algorithm for computing approximately maximums-t flows.
Negative-Weight shortest paths and unit capacity minimum cost flow in Õ(m[superscript 10/7] log W) Time
TLDR
This paper shows that each one of these four combinatorial optimization problems on weighted graphs can be solved in Õ(m logW ) time, where W is the absolute maximum weight of an edge in the graph, which gives the first in over 25 years polynomial improvement in their sparse-graph time complexity.
Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time (Extended Abstract)
TLDR
This paper studies a set of combinatorial optimization problems on weighted graphs, and shows that each of these four problems can be solved in O(m10/7 log W) time, providing the first polynomial improvement in their sparse-graph time complexity in over 25 years.
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
TLDR
A method for solving the shortest transshipment problem up to a multiplicative error of (1 + epsilon) in undirected graphs with non-negative integer edge weights using a tailored gradient descent algorithm is presented.
A Potential Reduction Inspired Algorithm for Exact Max Flow in Almost O͠(m4/3) Time
TLDR
An algorithm for computing s-t maximum flows in directed graphs in Õ(mU) time is presented, inspired by potential reduction interior point methods for linear programming and believes it may lead to faster algorithms for max flow.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 77 REFERENCES
A new approach to computing maximum flows using electrical flows
TLDR
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 and the minimizer is related to an approximate blocking flow is shown.
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
TLDR
This work introduces a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph and develops the fastest known algorithm for computing approximately maximums-t flows.
An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
TLDR
A new framework for approximately solving flow problems in capacitated, undirected graphs is introduced and it is applied to provide asymptotically faster algorithms for the maximum s-t flow and maximum concurrent multicommodity flow problems.
Maximum skew-symmetric flows and matchings
TLDR
This work extends to MSFP the shortest augmenting path method of Edmonds and Karp and the blocking flow method of Dinits, obtaining algorithms with similar time bounds in general case, and speed up the implied maximum matching algorithm to run in time, improving the best known bound for dense nonbipartite graphs.
Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest Cut
  • Jonah Sherman
  • Computer Science
    2009 50th Annual IEEE Symposium on Foundations of Computer Science
  • 2009
TLDR
The core of the algorithm is a stronger, algorithmic version of Arora et al.'s structure theorem, where it is shown that matching-chaining argument at the heart of their proof can be viewed as an algorithm that finds good augmenting paths in certain geometric multicommodity flow networks.
Nearly Maximum Flows in Nearly Linear Time
  • Jonah Sherman
  • Computer Science
    2013 IEEE 54th Annual Symposium on Foundations of Computer Science
  • 2013
We introduce a new approach to the maximum flow problem in undirected, capacitated graphs using congestion-approximators: easy-to-compute functions that approximate the congestion required to route
Maximal Flow Through a Network
Introduction. The problem discussed in this paper was formulated by T. Harris as follows: "Consider a rail network connecting two cities by way of a number of intermediate cities, where each link of
Max flows in O(nm) time, or better
TLDR
It is established that the max flow problem is solvable in O(nm) time for all values of n and m, and the running time is improved to O(n2/ log n).
Perfect matchings in o(n log n) time in regular bipartite graphs
TLDR
A randomized algorithm that finds a perfect matching in a d-regular graph and runs in O(n log n) time (both in expectation and with high probability) and is viewed as using adaptive uniform sampling, and is able to bypass the limitations of (non-adaptive) uniform sampling established in earlier work.
Faster approximate lossy generalized flow via interior point algorithms
TLDR
These algorithms reduce the problem of solving a linear system in a symmetric M-matrix to that of solving O{log n} linear systems in symmetric diagonally-dominant matrices, which they can do in time Om using the algorithm of Spielman and Teng.
...
1
2
3
4
5
...