Local edge-connectivity augmentation in hypergraphs is NP-complete

We consider a local edge-connectivity hypergraph augmentation problem. Specifically, we are given a hypergraph G=(V,E) and a subpartition of V. We are asked to find the smallest possible integer @c, for which there exists a set of size-two edges F, with |F|=@c, such that in G^'=(V,E@?F), the local edge-connectivity between any pair of vertices lying in the same part of the subpartition is at least a given value k. Using a transformation from the bin-packing problem, we show that the associated decision problem is NP-complete, even when k=2.

[1]  Zoltán Szigeti.  Hypergraph connectivity augmentation , 1999, Math. Program..

[2]  Tibor Jordán,et al.  On the Optimal Vertex-Connectivity Augmentation , 1995, J. Comb. Theory B.

[3]  András Frank,et al.  Preserving and Increasing Local Edge-Connectivity in Mixed Graphs , 1995, SIAM J. Discret. Math..

[4]  Akira Nakamura,et al.  Edge-Connectivity Augmentation Problems , 1987, J. Comput. Syst. Sci..

[5]  András Frank.  Augmenting Graphs to Meet Edge-Connectivity Requirements , 1992, SIAM J. Discret. Math..

[6]  Tamás Király.  Covering symmetric supermodular functions by uniform hypergraphs , 2004, J. Comb. Theory, Ser. B.

[7]  Guo-Ray Cai,et al.  The minimum augmentation of any graph to a K-edge-connected graph , 1989, Networks.

[8]  Eddie Cheng,et al.  Successive edge-connectivity augmentation problems , 1999, Math. Program..

[9]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[10]  Zeev Nutov.  Approximating connectivity augmentation problems , 2005, SODA '05.

[11]  András Frank,et al.  Covering symmetric supermodular functions by graphs , 1999, Math. Program..

[12]  Hiroshi Nagamochi.  Recent development of graph connectivity augmentation algorithms , 2000 .

[13]  András Frank,et al.  Edge-Connection of Graphs, Digraphs, and Hypergraphs , 2006 .

[14]  Hiroshi Nagamochi,et al.  On the Minimum Local-Vertex-Connectivity Augmentation in Graphs , 2001, ISAAC.

[15]  András Frank,et al.  Minimal Edge-Coverings of Pairs of Sets , 1995, J. Comb. Theory B.

[16]  Jørgen Bang-Jensen,et al.  Augmenting hypergraphs by edges of size two , 1999, Math. Program..

[17]  Ben Cosh.  Vertex splitting and connectivity augmentation in hypergraphs , 2000 .

[18]  Bernhard Korte,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[19]  Attila Bernáth,et al.  A New Approach to Splitting-Off , 2008, IPCO.

[20]  Tibor Jordán,et al.  Detachments Preserving Local Edge-Connectivity of Graphs , 2003, SIAM J. Discret. Math..

[21]  Bill Jackson,et al.  Independence free graphs and vertex connectivity augmentation , 2001, J. Comb. Theory, Ser. B.