Minimum Cuts and Sparsification in Hypergraphs

We study algorithmic and structural aspects of connectivity in hypergraphs. Given a hypergraph $H=(V,E)$ with $n = |V|$, $m = |E|$, and $p = \sum_{e \in E} |e|$ the fastest known algorithm to compu...

[1]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[2]  Mechthild Stoer,et al.  A simple min-cut algorithm , 1997, JACM.

[3]  Mingyu Xiao,et al.  Finding minimum 3-way cuts in hypergraphs , 2008, Inf. Process. Lett..

[4]  Chao Xu,et al.  A note on approximate strengths of edges in a hypergraph , 2017, ArXiv.

[5]  Kurt Mehlhorn,et al.  A Correctness Certificate for the Stoer-Wagner Min-Cut Algorithm , 1999, Inf. Process. Lett..

[6]  Toshihide Ibaraki,et al.  Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..

[7]  Romeo Rizzi.  NOTE – On Minimizing Symmetric Set Functions , 2000, Comb..

[8]  David R. Karger,et al.  Random Contractions and Sampling for Hypergraph and Hedge Connectivity , 2017, SODA.

[9]  Lisa Fleischer,et al.  Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time , 1998, J. Algorithms.

[10]  Debmalya Panigrahi,et al.  A general framework for graph sparsification , 2010, STOC '11.

[11]  D. Karger,et al.  Random sampling in graph optimization problems , 1995 .

[12]  Eddie Cheng.  Edge-augmentation of hypergraphs , 1999, Math. Program..

[13]  David R. Karger,et al.  A near-linear time algorithm for constructing a cactus representation of minimum cuts , 2009, SODA.

[14]  Douglas R. Shier,et al.  A paradigm for listing (s, t)-cuts in graphs , 2005, Algorithmica.

[15]  András Frank,et al.  Egerváry Research Group on Combinatorial Optimization on Decomposing a Hypergraph into K Connected Sub-hypergraphs on Decomposing a Hypergraph into K Connected Sub-hypergraphs , 2022 .

[16]  Robert Krauthgamer,et al.  Sketching Cuts in Graphs and Hypergraphs , 2014, ITCS.

[17]  Yutaro Yamaguchi,et al.  Realizing symmetric set functions as hypergraph cut capacity , 2016, Discret. Math..

[18]  D. Matula.  A linear time 2 + ε approximation algorithm for edge connectivity , 1993, SODA 1993.

[19]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[20]  Ken-ichi Kawarabayashi,et al.  Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time , 2014, STOC.

[21]  Martin D. F. Wong,et al.  A fast hypergraph min-cut algorithm for circuit partitioning , 2000, Integr..

[22]  Vijay V. Vazirani,et al.  Finding k-cuts within twice the optimal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[23]  Eugene L. Lawler,et al.  Cutsets and partitions of hypergraphs , 1973, Networks.

[24]  Tibor Jordán,et al.  Coverings and structure of crossing families , 1999, Math. Program..

[25]  Frank Wagner,et al.  A simple hypergraph min cut algorithm , 1996 .

[26]  Di Wang,et al.  Local Flow Partitioning for Faster Edge Connectivity , 2017, SODA.

[27]  David R. Karger,et al.  Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs , 2002, SIAM J. Comput..

[28]  David R. Karger,et al.  Minimum cuts in near-linear time , 1998, JACM.

[29]  Yin Tat Lee,et al.  An SDP-based algorithm for linear-sized spectral sparsification , 2017, STOC.

[30]  Bernard Chazelle.  Computing on a Free Tree via Complexity-Preserving Mappings , 1984, FOCS.

[31]  E. A. Dinic.  Algorithm for solution of a problem of maximal flow in a network with power estimation , 1970 .

[32]  Sudipto Guha,et al.  Vertex and Hyperedge Connectivity in Dynamic Graph Streams , 2015, PODS.

[33]  James B. Orlin,et al.  Max flows in O(nm) time, or better , 2013, STOC '13.

[34]  Chao Xu,et al.  Computing minimum cuts in hypergraphs , 2016, SODA.

[35]  Ali Ridha Mahjoub,et al.  Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs , 2015, Mathematical Programming.

[36]  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.

[37]  Michael Brinkmeier,et al.  Minimizing Symmetric Set Functions Faster , 2006, ArXiv.

[38]  William H. Cunningham,et al.  Decomposition of submodular functions , 1983, Comb..

[39]  Toshihide Ibaraki,et al.  Algorithmic Aspects of Graph Connectivity , 2008, Encyclopedia of Mathematics and its Applications.

[40]  Harold N. Gabow,et al.  The Minset-Poset Approach to Representations of Graph Connectivity , 2016, ACM Trans. Algorithms.

[41]  Takuro Fukunaga,et al.  Computing minimum multiway cuts in hypergraphs , 2013, Discret. Optim..

[42]  David R. Karger,et al.  A new approach to the minimum cut problem , 1996, JACM.

[43]  J. Edmonds,et al.  A Combinatorial Decomposition Theory , 1980, Canadian Journal of Mathematics.

[44]  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.

[45]  A. Frank.  Connections in Combinatorial Optimization , 2011 .

[46]  Maurice Queyranne,et al.  Minimizing symmetric submodular functions , 1998, Math. Program..

[47]  Chao Xu,et al.  Hypergraph k-cut in randomized polynomial time , 2018, Mathematical Programming.

[48]  Nikhil Srivastava,et al.  Twice-ramanujan sparsifiers , 2008, STOC '09.

[49]  Chandra Chekuri,et al.  Some Open Problems in Element-Connectivity , 2015 .

[50]  Toshihide Ibaraki,et al.  On sparse subgraphs preserving connectivity properties , 1993, J. Graph Theory.

[51]  Satoru Fujishige.  Canonical decompositions of symmetric submodular systems , 1983, Discret. Appl. Math..

[52]  Dorit S. Hochbaum,et al.  A Polynomial Algorithm for the k-cut Problem for Fixed k , 1994, Math. Oper. Res..

[53]  Hiroshi Nagamochi,et al.  Constructing a cactus for minimum cust og a graph in O(mn+n2log n) time and O(m) space , 2003 .

[54]  Mikkel Thorup,et al.  Minimum k-way cuts via deterministic greedy tree packing , 2008, STOC.