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}
}
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… CONTINUE READING
Highly Cited
This paper has 132 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 8 times over the past 90 days. VIEW TWEETS
89 Citations
56 References
Similar Papers

Citations

Publications citing this paper.

133 Citations

02040'13'14'15'16'17'18
Citations per Year
Semantic Scholar estimates that this publication has 133 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…