Subscribe
Issue No.07 - July (2012 vol.61)
pp: 954-968
Longkun Guo , Univ. of Science & Technology of China, Hefei
ABSTRACT
For an undirected and weighted graph G=(V,E) and a terminal set S\subseteq V, the 2-connected Steiner minimal network (SMN) problem requires to compute a minimum-weight subgraph of G in which all terminals are 2-connected to each other. This problem has important applications in design of survivable networks and fault-tolerant communication, and is known MAXSNP-hard , a harder subclass of NP-hard problems for which no polynomial-time approximation scheme (PTAS) is known. This paper presents an efficient algorithm of O(\vert V\vert^{2}\vert S\vert^{3}) time for computing a 2-vertex connected Steiner network (2VSN) whose weight is bounded by two times of the optimal solution 2-vertex connected SMN (2VSMN). It compares favorably with the currently known 2--approximation solution to the 2VSMN problem based on that to the survivable network design problem], with a time complexity reduction of O(\vert V\vert^{5}\vert E\vert^{7}) for strongly polynomial time and O(\vert V\vert^{5}\gamma ) for weakly polynomial time where \gamma is determined by the sizes of input. Our algorithm applies a novel greedy approach to generate a 2VSN through progressive improvement on a set of vertex-disjoint shortest path pairs incident with each terminal of S. The algorithm can be directly deployed to solve the 2-edge connected SMN problem at the same approximation ratio within time O(\vert V\vert^{2}\vert S\vert^{2}). To the best of our knowledge, this result presents currently the most efficient 2-approximation algorithm for the 2-connected Steiner minimal network problem.
INDEX TERMS
Survivable network design, 2-vertex (edge) connected Steiner minimal network, terminal spanning-tree, approximation algorithm, shortest disjoint path pair, Euler walk.
CITATION
Hong Shen, Longkun Guo, "Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks", IEEE Transactions on Computers, vol.61, no. 7, pp. 954-968, July 2012, doi:10.1109/TC.2011.123
REFERENCES
 [1] V. Auletta, Y. Dinitz, Z. Nutov, and D. Parente, “A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph,” J. Algorithms, vol. 32, no. 1, pp. 21-30, 1999. [2] R. Bhandari, “Optimal Physical Diversity Algorithms and Survivable Networks,” Proc. Second IEEE Symp. Computers and Comm., pp. 433-441, 1997. [3] J. Byrka, F. Grandoni, T. Rothvoß, and L. Sanità, “An Improved LP-Based Approximation for Steiner Tree,” Proc. 42nd ACM Symp. Theory of Computing, pp. 583-592, 2010. [4] J. Cheriyan, S. Vempala, and A. Vetta, “Approximation Algorithms for Minimum-Cost K-Vertex Connected Subgraphs,” Proc. 34th Ann. ACM Symp. Theory of Computing, pp. 306-312, 2002. [5] J. Chuzhoy and S. Khanna, “An $O (k^3 log n)$ -Approximation Algorithm for Vertex-Connectivity Survivable Network Design,” Proc. Ann. IEEE Symp. Foundations of Computer Science, 2009. [6] Y. Dinitz and Z. Nutov, “A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs,” J. Algorithms, vol. 32, no. 1, pp. 31-40, 1999. [7] C.G. Fernandes, “A Better Approximation Ratio for the Minimum K-Edge-Connected Spanning Subgraph Problem,” Proc. Eighth Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 629-638, 1997. [8] L. Fleischer, “A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity,” Proc. Int'l IPCO Conf. Integer Programming and Combinatorial Optimization, pp. 115-129, 2001. [9] L. Fleischer, K. Jain, and D. Williamson, “An Iterative Rounding 2-Approximation Algorithm for the Element Connectivity Problem,” Proc. 42nd IEEE Symp. Foundations of Computer Science, p. 339, 2001. [10] L. Fleischer, K. Jain, and D.P. Williamson, “Iterative Rounding 2-Approximation Algorithms for Minimum-Cost Vertex Connectivity Problems,” J. Computer and System Sciences, vol. 72, no. 5, pp. 838-867, 2006. [11] H.N. Gabow and S. Gallagher, “Iterated Rounding Algorithms for the Smallest K-Edge Connected Spanning Subgraph,” Proc. 19th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 550-559, 2008. [12] H.N. Gabow, M.X. Goemans, and D.P. Williamson, “An Efficient Approximation Algorithm for the Survivable Network Design Problem,” Math. Programming, vol. 82, no. 1, pp. 13-40, 1998. [13] R. Halin, “A Theorem on N-Connected Graphs,” J. Combinatorial Theory, vol. 7, no. 2, pp. 150-154, 1969. [14] D.F. Hsu and X.D. Hu, “On Shortest Two-Connected Steiner Networks with Euclidean Distance,” Networks, vol. 32, no. 2, pp. 133-140, 1998. [15] K. Hvam, L. Reinhardt, P. Winter, and M. Zachariasen, “Bounding Component Sizes of Two-Connected Steiner Networks,” Information Processing Letters, vol. 104, no. 5, pp. 159-163, 2007. [16] K. Jain, “A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem,” Combinatorica, vol. 21, no. 1, pp. 39-60, 2001. [17] S. Khuller, Approximation Algorithms for Finding Highly Connected Subgraphs. Univ. of Maryland, 1995. [18] S. Khuller and U. Vishkin, “Biconnectivity Approximations and Graph Carvings,” J. ACM, vol. 41, no. 2, pp. 214-235, 1994. [19] B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms, Algorithms and Combinatorics, Springer, 2007. [20] G. Kortsarz, R. Krauthgamer, and J.R. Lee, “Hardness of Approximation for Vertex-Connectivity Network Design Problems,” Proc. Fifth Int'l Workshop Approximation Algorithms for Combinatorial Optimization, pp. 185-199, 2002. [21] G. Kortsarz and Z. Nutov, “Approximating Node Nonnectivity Problems via Set Covers,” Algorithmica, vol. 37, no. 2, pp. 75-92, 2003. [22] G. Kortsarz and Z. Nutov, “Approximation Algorithm for K-Node Connected Subgraphs via Critical Graphs,” Proc. 36th Ann. ACM Symp. Theory of Computing, pp. 138-145, 2004. [23] G. Kortsarz and Z. Nutov, “Approximating Minimum Cost Connectivity Problems,” Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall, 2007. [24] L. Kou, G. Markowsky, and L. Berman, “A Fast Algorithm for Steiner Trees,” Acta Informatica, vol. 15, no. 2, pp. 141-145, 1981. [25] E.L. Luebke and J.S. Provan, “On the Structure and Complexity of the 2-Connected Steiner Network Problem in the Plane,” Operations Research Letters, vol. 26, no. 3, pp. 111-116, 2000. [26] Z. Nutov, “An Almost O (log k)-Approximation for K-Connected Subgraphs,” Proc. 19th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 912-921, 2009. [27] Z. Nutov, “Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions,” Proc. 50th Ann. IEEE Symp. Foundations of Computer Science (FOCS '09), pp. 417-426, 2010. [28] R. Ravi, “An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems,” Algorithmica, vol. 18, no. 1, pp. 21-43, 1997. [29] R. Ravi and D.P. Williamson, “Erratum: An Approximation for Minimum-Cost Vertex-Connectivity Problems,” Proc. 13th Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 1000-1001, 2002. [30] G. Robins and A. Zelikovsky, “Tighter Bounds for Graph Steiner Tree Approximation,” SIAM J. Discrete Math., vol. 19, no. 1, pp. 122-134, 2006. [31] J.W. Suurballe and R.E. Tarjan, “A Quick Methods for Finding Shortest Pairs of Disjoint Paths,” Networks, vol. 14, no. 2, pp. 325-336, 1984. [32] D.P. Williamson, “The Primal-Dual Method for Approximation Algorithms,” Math. Programming, vol. 91, no. 3, pp. 447-478, 2002. [33] P. Winter and M. Zachariasen, “Two-Connected Steiner Networks: Structural Properties,” Operations Research Letters, vol. 33, no. 4, pp. 395-402, 2005.