A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond
暂无分享,去创建一个
[1] Cristiane M. Sato,et al. Sparse Sums of Positive Semidefinite Matrices , 2011, TALG.
[2] Fan Chung Graham,et al. Using PageRank to Locally Partition a Graph , 2007, Internet Math..
[3] Shang-Hua Teng,et al. Spectral Sparsification of Graphs , 2008, SIAM J. Comput..
[4] Jonah Sherman,et al. Area-convexity, l∞ regularization, and undirected multicommodity flow , 2017, STOC.
[5] Deeksha Adil,et al. Faster p-norm minimizing flows, via smoothed q-norm problems , 2020, SODA.
[6] Andrew V. Goldberg,et al. Beyond the flow decomposition barrier , 1998, JACM.
[7] HolmJacob,et al. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001 .
[8] Harald Räcke,et al. Minimizing Congestion in General Networks , 2002, FOCS.
[9] Richard Peng,et al. Flows in almost linear time via adaptive preconditioning , 2019, STOC.
[10] Christian Wulff-Nilsen,et al. Faster Deterministic Fully-Dynamic Graph Connectivity , 2012, Encyclopedia of Algorithms.
[11] Ittai Abraham,et al. Using petal-decompositions to build a low stretch spanning tree , 2012, STOC '12.
[12] Nisheeth K. Vishnoi,et al. Towards an SDP-based approach to spectral methods: a nearly-linear-time algorithm for graph partitioning and decomposition , 2010, SODA '11.
[13] Shang-Hua Teng,et al. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.
[14] Zeyuan Allen Zhu,et al. Flow-Based Algorithms for Local Graph Clustering , 2013, SODA.
[15] Aleksander Madry,et al. Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[16] Richard Peng,et al. Deterministic Graph Cuts in Subquadratic Time: Sparse, Balanced, and k-Vertex , 2019, ArXiv.
[17] Valerie King. Fully Dynamic Connectivity , 2016, Encyclopedia of Algorithms.
[18] Sushant Sachdeva,et al. Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and Simple , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[19] Jonah Sherman,et al. Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest Cut , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[20] Monika Henzinger,et al. A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths , 2014, SODA.
[21] Andrew V. Goldberg,et al. Finding minimum-cost flows by double scaling , 2015, Math. Program..
[22] Nisheeth K. Vishnoi,et al. On a Cut-Matching Game for the Sparsest Cut Problem , 2007 .
[23] Shang-Hua Teng,et al. Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems , 2006, SIAM J. Matrix Anal. Appl..
[24] Monika Henzinger,et al. Distributed edge connectivity in sublinear time , 2019, STOC.
[25] Nikhil Srivastava,et al. Graph Sparsification by Effective Resistances , 2011, SIAM J. Comput..
[26] Santosh S. Vempala,et al. On clusterings: Good, bad and spectral , 2004, JACM.
[27] 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).
[28] Chintan Shah,et al. Computing Cut-Based Hierarchical Decompositions in Almost Linear Time , 2014, SODA.
[29] Aaron Bernstein,et al. Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs , 2017, ICALP.
[30] Noga Alon,et al. Eigenvalues and expanders , 1986, Comb..
[31] Richard Peng,et al. Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression , 2019, NeurIPS.
[32] Aleksander Madry,et al. Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms , 2010, STOC '10.
[33] Andrew V. Goldberg,et al. Scaling algorithms for the shortest paths problem , 1995, SODA '93.
[34] Shi Li,et al. A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 , 2012, FOCS.
[35] Jakub W. Pachocki,et al. Solving SDD linear systems in nearly mlog1/2n time , 2014, STOC.
[36] Monika Henzinger,et al. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs , 2014, STOC.
[37] Mikkel Thorup,et al. Near-optimal fully-dynamic graph connectivity , 2000, STOC '00.
[38] Zeyuan Allen Zhu,et al. Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates , 2015, STOC.
[39] Di Wang,et al. Local Flow Partitioning for Faster Edge Connectivity , 2017, SODA.
[40] Satish Rao,et al. Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.
[41] Monika Henzinger,et al. Maintaining Minimum Spanning Trees in Dynamic Graphs , 1997, ICALP.
[42] Mikkel Thorup,et al. Sampling to provide or to bound: With applications to fully dynamic graph algorithms , 1997, Random Struct. Algorithms.
[43] Richard Peng,et al. Approximate Undirected Maximum Flows in O(mpolylog(n)) Time , 2014, SODA.
[44] Yin Tat Lee,et al. An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations , 2013, SODA.
[45] Christian Wulff-Nilsen,et al. Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[46] Zvi Galil,et al. Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..
[47] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.
[48] Monika Henzinger,et al. Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[49] Daniel A. Spielman,et al. Faster approximate lossy generalized flow via interior point algorithms , 2008, STOC.
[50] Satish Rao,et al. Graph partitioning using single commodity flows , 2006, STOC '06.
[51] Di Wang,et al. Expander Decomposition and Pruning: Faster, Stronger, and Simpler , 2018, SODA.
[52] Greg N. Frederickson,et al. Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..
[53] Chandra Chekuri,et al. Large-treewidth graph decompositions and applications , 2013, STOC '13.
[54] Andrew V. Goldberg,et al. A new approach to the maximum flow problem , 1986, STOC '86.
[55] 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.
[56] Richard Peng,et al. Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[57] Yefim Dinitz,et al. Dinitz' Algorithm: The Original Version and Even's Version , 2006, Essays in Memory of Shimon Even.
[58] Christian Wulff-Nilsen,et al. Fully-dynamic minimum spanning forest with improved worst-case update time , 2016, STOC.
[59] Mikkel Thorup,et al. Faster Worst Case Deterministic Dynamic Connectivity , 2016, ESA.
[60] Julia Chuzhoy,et al. A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems , 2019, STOC.
[61] Luca Trevisan,et al. Approximation algorithms for unique games , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[62] Frank Thomson Leighton,et al. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.
[63] Sushant Sachdeva,et al. Short Cycles via Low-Diameter Decompositions , 2018, SODA.
[64] Shimon Even,et al. An On-Line Edge-Deletion Problem , 1981, JACM.
[65] Nikhil Srivastava,et al. Twice-ramanujan sparsifiers , 2008, STOC '09.
[66] Chandra Chekuri,et al. Polynomial bounds for the grid-minor theorem , 2013, J. ACM.
[67] Yi-Jun Chang,et al. Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration , 2019, PODC.
[68] Yin Tat Lee,et al. An SDP-based algorithm for linear-sized spectral sparsification , 2017, STOC.
[69] Tsvi Kopelowitz,et al. Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time , 2016, SODA.
[70] David Eppstein,et al. Sparsification—a technique for speeding up dynamic graph algorithms , 1997, JACM.
[71] Thatchaphol Saranurak,et al. Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n1/2 - ε)-time , 2017, STOC.
[72] Jonah Sherman,et al. Nearly Maximum Flows in Nearly Linear Time , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[73] Lisa Fleischer,et al. Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..
[74] Aleksander Madry,et al. Computing Maximum Flow with Augmenting Electrical Flows , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[75] Erik D. Demaine,et al. Logarithmic Lower Bounds in the Cell-Probe Model , 2005, SIAM J. Comput..
[76] Robert E. Tarjan,et al. Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..
[77] Monika Henzinger,et al. Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[78] Bruce M. Kapron,et al. Dynamic graph connectivity in polylogarithmic worst case time , 2013, SODA.
[79] Mikkel Thorup,et al. Planning for Fast Connectivity Updates , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[80] Andrew V. Goldberg,et al. Solving minimum-cost flow problems by successive approximation , 1987, STOC.
[81] George Karakostas,et al. Faster approximation schemes for fractional multicommodity flow problems , 2008, TALG.
[82] Dana Ron,et al. A Sublinear Bipartiteness Tester for Bounded Degree Graphs , 1998, STOC '98.
[83] Thatchaphol Saranurak,et al. Breaking quadratic time for small vertex connectivity and an approximation scheme , 2019, STOC.
[84] E. A. Dinic. Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .
[85] Elad Hazan,et al. O(/spl radic/log n) approximation to SPARSEST CUT in O/spl tilde/(n/sup 2/) time , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[86] Nisheeth K. Vishnoi,et al. Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator , 2011, STOC '12.
[87] David R. Karger,et al. Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs , 2002, SIAM J. Comput..
[88] Nisheeth K. Vishnoi,et al. On partitioning graphs via single commodity flows , 2008, STOC.
[89] Ken-ichi Kawarabayashi,et al. Deterministic Edge Connectivity in Near-Linear Time , 2014, J. ACM.
[90] Richard Peng,et al. Sparsified Cholesky and multigrid solvers for connection laplacians , 2015, STOC.
[91] 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.
[92] Shi Li,et al. A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[93] Liam Roditty,et al. Improved dynamic algorithms for maintaining approximate shortest paths under deletions , 2011, SODA '11.
[94] Bruce M. Kapron,et al. Dynamic graph connectivity with improved worst case update time and sublinear space , 2015, ArXiv.
[95] Shang-Hua Teng,et al. Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time O(m1.31) , 2003, ArXiv.
[96] Mikkel Thorup,et al. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 1998, STOC '98.
[97] Ittai Abraham,et al. Nearly Tight Low Stretch Spanning Trees , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[98] Piotr Sankowski,et al. Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time (Extended Abstract) , 2016, SODA.
[99] Richard Peng,et al. Iterative Refinement for ℓp-norm Regression , 2019, SODA.
[100] Shiri Chechik,et al. Deterministic decremental single source shortest paths: beyond the o(mn) bound , 2016, STOC.