Some Open Problems in Element-Connectivity

The notion of element-connectivity has found several important applications. An important tool for these applications is a graph reduction step that preserves element-connectivity [19, 4]. In this article we survey several open problems related to this reduction step as well as some related problems on edge-connectivity.

[1]  Piotr Sankowski,et al.  Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[2]  Satish Rao,et al.  Computing vertex connectivity: new bounds from old techniques , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[3]  Chandra Chekuri,et al.  Approximate Integer Decompositions for Undirected Network Design Problems , 2008, SIAM J. Discret. Math..

[4]  L. Lau.  On approximate min-max theorems for graph connectivity problems , 2006 .

[5]  W. Mader.  A Reduction Method for Edge-Connectivity in Graphs , 1978 .

[6]  L. Lovász.  On some connectivity properties of Eulerian graphs , 1976 .

[7]  Lap Chi Lau,et al.  An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem* , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[8]  Harold N. Gabow,et al.  Using expander graphs to find vertex connectivity , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

[10]  Lap Chi Lau,et al.  Graph Connectivities, Network Coding, and Expander Graphs , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[11]  Huy L. Nguyen,et al.  Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions , 2015, ICML.

[12]  Jonah Sherman,et al.  Nearly Maximum Flows in Nearly Linear Time , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[13]  Chandra Chekuri,et al.  A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests , 2014, SIAM J. Discret. Math..

[14]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

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

[16]  Chao Xu,et al.  On Element-Connectivity Preserving Graph Simplification , 2015, ESA.

[17]  Ran Duan,et al.  Breaking the O(n2.5) Time Barrier for Undirected Unit-Capacity Maximum Flow , 2013, SODA.

[18]  Matthias Kriesell,et al.  Edge-disjoint trees containing some given vertices in a graph , 2003, J. Comb. Theory, Ser. B.

[19]  Yin Tat Lee,et al.  An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations , 2013, SODA.

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

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

[22]  Douglas B. West,et al.  Packing of Steiner trees and S-connectors in graphs , 2012, J. Comb. Theory, Ser. B.

[23]  Robert E. Tarjan,et al.  Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..

[24]  Debmalya Panigrahi,et al.  An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs , 2007, STOC '07.

[25]  Lap Chi Lau,et al.  Packing Steiner Forests , 2005, IPCO.

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

[27]  Mohammad R. Salavatipour,et al.  Packing element-disjoint steiner trees , 2005, APPROX-RANDOM.

[28]  Hiroshi Hirai,et al.  Tree metrics and edge-disjoint $$S$$S-paths , 2014, Math. Program..

[29]  Jan Vondrák,et al.  Disjoint bases in a polymatroid , 2009, Random Struct. Algorithms.

[30]  Philip N. Klein,et al.  Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs , 2009, TALG.

[31]  Joseph Cheriyan,et al.  Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs , 2009, Algorithmica.

[32]  Laurence A. Wolsey,et al.  An analysis of the greedy algorithm for the submodular set covering problem , 1982, Comb..

[33]  Robert D. Carr,et al.  Randomized metarounding , 2002, Random Struct. Algorithms.

[34]  Matt DeVos,et al.  Packing Steiner trees , 2013, J. Comb. Theory, Ser. B.

[35]  Richard Peng,et al.  Approximate Undirected Maximum Flows in O(mpolylog(n)) Time , 2014, SODA.