## Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum Flow

- Yin Tat Lee, Aaron Sidford
- 2014 IEEE 55th Annual Symposium on Foundations of…
- 2014

Highly Influenced

@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} }

- Published 2013 in 2013 IEEE 54th Annual Symposium on Foundations of…
DOI:10.1109/FOCS.2013.35

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 per Year

Semantic Scholar estimates that this publication has **133** citations based on the available data.

See our **FAQ** for additional information.