Corpus ID: 17681369

Path Finding II : An Õ(m sqrt(n)) Algorithm for the Minimum Cost Flow Problem

@article{Lee2013PathFI,
  title={Path Finding II : An {\~O}(m sqrt(n)) Algorithm for the Minimum Cost Flow Problem},
  author={Y. Lee and Aaron Sidford},
  journal={arXiv: Data Structures and Algorithms},
  year={2013}
}
  • Y. Lee, Aaron Sidford
  • Published 2013
  • Mathematics, Computer Science
  • arXiv: Data Structures and Algorithms
  • In this paper we present an $\tilde{O}(m\sqrt{n}\log^{O(1)}U)$ time algorithm for solving the maximum flow problem on directed graphs with $m$ edges, $n$ vertices, and capacity ratio $U$. This improves upon the previous fastest running time of $O(m\min\left(n^{2/3},m^{1/2}\right)\log\left(n^{2}/m\right)\log U)$ achieved over 15 years ago by Goldberg and Rao. In the special case of solving dense directed unit capacity graphs our algorithm improves upon the previous fastest running times of of $O… CONTINUE READING
    The Lack of International Consumption Risk Sharing: Can Inflation Differentials and Trading Costs Help Explain the Puzzle?
    9
    Algorithms for the Geometric Transportation Problem
    Solving Linear Programs with Sqrt(rank) Linear System Solves
    6
    Solving Linear Programs with Õ ( √ rank ) Linear System Solves
    5

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 41 REFERENCES
    Analysis of pressure applied during microlaryngoscopy
    16
    Moth pheromone genetics and evolution
    193
    Tuberculosis in complex emergencies.
    31
    Cooperation and competition in pathogenic bacteria
    813
    Diversity of Eucalyptus species predicted by a multi-variable environmental gradient
    82