Polynomial Time Algorithms for 2-Edge-Connectivity Augmentation Problems

Given a 2-edge-connected, real weighted graph G with n vertices and m edges, the 2-edge-connectivity augmentation problem is that of finding a minimum weight set of edges of G to be added to a spanning subgraph H of G to make it 2-edge-connected. While the general problem is NP-hard and 2 -approximable, in this paper we prove that it becomes polynomial time solvable if H is a depth-first search tree of G . More precisely, we provide an efficient algorithm for solving this special case which runs in O(M · α(M,n)) time, where α is the classic inverse of Ackermann's function and M=m · α(m,n) . This algorithm has two main consequences: first, it provides a faster 2 -approximation algorithm for the general 2 -edge-connectivity augmentation problem; second, it solves in O(m · α(m,n)) time the problem of restoring, by means of a minimum weight set of replacement edges, the 2 -edge-connectivity of a 2-edge-connected communication network undergoing a link failure.

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

[2]  S. Khuller.  Approximation algorithms for finding highly connected subgraphs , 1996 .

[3]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[4]  Guido Proietti,et al.  A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation , 2002, ISAAC.

[5]  Robert E. Tarjan,et al.  Augmentation Problems , 1976, SIAM J. Comput..

[6]  Joseph JáJá,et al.  Approximation Algorithms for Several Graph Augmentation Problems , 1981, SIAM J. Comput..

[7]  Guido Proietti,et al.  Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths , 2001, ISAAC.

[8]  Cristina G. Fernandes.  A better approximation ratio for the minimum k-edge-connected spanning subgraph problem , 1997, SODA '97.

[9]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[10]  Robert E. Tarjan,et al.  Applications of Path Compression on Balanced Trees , 1979, JACM.

[11]  S. Khuller,et al.  Approximation Algorithms for Graph Augmentation , 1992, J. Algorithms.

[12]  Robert E. Tarjan,et al.  Sensitivity Analysis of Minimum Spanning Trees and Shortest Path Trees , 1982, Inf. Process. Lett..

[13]  Hiroshi Nagamochi,et al.  An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree , 1999, Discret. Appl. Math..

[14]  Harold N. Gabow,et al.  Applications of a poset representation to edge connectivity and graph rigidity , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[15]  Guido Proietti,et al.  On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality , 2002, Theor. Comput. Sci..

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

[17]  Jon Feldman,et al.  A 3/2-Approximation Algorithm for Augmenting the Edge-Connectivity of a Graph from 1 to 2 Using a Subset of a Given Edge Set , 2001, RANDOM-APPROX.