Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths
Given a graph G of n vertices and m edges, and given a spanning subgraph H of G, the problem of finding a minimum weight set of edges of G, denoted as Aug2(H,G), to be added to H to make it 2-edge connected, is known to be NP-hard. In this paper, we present polynomial time effcient algorithms for solving the special case of this classic augmentation problem in which the subgraph H is a Hamiltonian path of G. More precisely, we show that if G is unweighted, then Aug2(H,G) can be computed in O(m) time and space, while if G is non-negatively weighted, then Aug2(H,G) can be comp uted in O(m+n log n) time and O(m) space. These results have an interesting application for solving a survivability problem on communication networks.
KeywordsGraph Hamiltonian path augmentation 2-edge connectivity network survivability
Unable to display preview. Download preview PDF.
- 1.A. V. Aho, J. E. Hopcroft and J. D. Ullman, The design and analysis of computeralgorithms, Addison Wesley, (1974).Google Scholar
- 2.G. S. Brodal, Worst-case effcient priority queues, Proc. 7th Annual ACM-SIAMSymp. on Discrete Algorithms (SODA’96), ACM/IEEE Computer Society, 52–58.Google Scholar
- 6.H. N. Gabow, Application of a poset representation to edge connectivity andgraph rigidity, Proc. 32nd Ann. IEEE Symp. on Foundations of Computer Science(FOCS’91), IEEE Computer Society, 812–821.Google Scholar
- 7.A. Galluccio and G. Proietti, Towards a 4/3-approximation algorithm for biconnectivity,IASI-CNR Technical report R. 506, June 1999. Submitted for publication.Google Scholar
- 10.S. Khuller, Approximation algorithms for finding highly connected subgraphs, in Approximation Algorithms for NP-Hard Problems, Dorit S. Hochbaum Eds., PWSPublishing Company, Boston, MA, 1996.Google Scholar
- 14.S. Vempala and A. Vetta, Factor 4/3 approximations for minimum 2-connectedsubgraphs, Proc. 3rd Int. Workshop on Approximation Algorithms for CombinatorialOptimization Problems (APPROX 2000), Vol. 1913 of Lecture Notes in ComputerScience, Springer, 262–273.Google Scholar