Unit Capacity Maxflow in Almost $O(m^{4/3})$ Time
暂无分享,去创建一个
[1] Aaron Sidford,et al. Faster Divergence Maximization for Faster Maximum Flow , 2020, ArXiv.
[2] Yin Tat Lee,et al. An homotopy method for lp regression provably beyond self-concordance and in input-sparsity time , 2018, STOC.
[3] Andrew V. Goldberg,et al. Beyond the flow decomposition barrier , 1998, JACM.
[4] Shang-Hua Teng,et al. Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems , 2006, SIAM J. Matrix Anal. Appl..
[5] Satish Rao,et al. A new approach to computing maximum flows using electrical flows , 2013, STOC '13.
[6] David R. Karger,et al. Random sampling in cut, flow, and network design problems , 1994, STOC '94.
[7] Richard Peng,et al. Flows in almost linear time via adaptive preconditioning , 2019, STOC.
[8] Kevin Tian,et al. Coordinate Methods for Accelerating ℓ∞ Regression and Faster Approximate Maximum Flow , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[9] Yin Tat Lee,et al. Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum Flow , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[10] A. Madry,et al. Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ(m 10/7 log W) Time. , 2016 .
[11] Yurii Nesterov,et al. Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.
[12] David R. Karger. Better random sampling algorithms for flows in undirected graphs , 1998, SODA '98.
[13] David R. Karger,et al. Finding maximum flows in undirected graphs seems easier than bipartite matching , 1998, STOC '98.
[14] Jonah Sherman,et al. Nearly Maximum Flows in Nearly Linear Time , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[15] Shang-Hua Teng,et al. Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs , 2010, STOC '11.
[16] Yin Tat Lee,et al. Solving tall dense linear programs in nearly linear time , 2020, STOC.
[17] Adrian Vladu,et al. Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[18] Richard Peng,et al. Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[19] Aaron Sidford,et al. Faster energy maximization for faster maximum flow , 2019, STOC.
[20] Deeksha Adil,et al. Faster p-norm minimizing flows, via smoothed q-norm problems , 2020, SODA.
[21] Yin Tat Lee,et al. Solving linear programs in the current matrix multiplication time , 2018, STOC.
[22] Richard Peng,et al. Approximate Undirected Maximum Flows in O(mpolylog(n)) Time , 2014, SODA.
[23] Yin Tat Lee,et al. An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations , 2013, SODA.
[24] James Renegar,et al. A mathematical view of interior-point methods in convex optimization , 2001, MPS-SIAM series on optimization.
[25] James B. Orlin,et al. Max flows in O(nm) time, or better , 2013, STOC '13.
[26] Tarun Kathuria,et al. A Potential Reduction Inspired Algorithm for Exact Max Flow in Almost O͠(m4/3) Time , 2020, ArXiv.
[27] David R. Karger,et al. Using random sampling to find maximum flows in uncapacitated undirected graphs , 1997, STOC '97.
[28] Daniel A. Spielman,et al. Faster approximate lossy generalized flow via interior point algorithms , 2008, STOC.
[29] Robert E. Tarjan,et al. Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..
[30] Jonah Sherman,et al. Area-convexity, l∞ regularization, and undirected multicommodity flow , 2017, STOC.
[31] Henry C. Lin. Reducing Directed Max Flow to Undirected Max Flow and Bipartite Matching , 2009 .
[32] Aleksander Madry,et al. Navigating Central Path with Electrical Flows: From Flows to Matchings, and Back , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[33] Richard Peng,et al. A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond , 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).
[34] Aleksander Madry,et al. Computing Maximum Flow with Augmenting Electrical Flows , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[35] K. Anstreicher. Potential Reduction Algorithms , 1996 .