
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Hong Shen, Longkun Guo, "Efficient 2Approximation Algorithms for Computing 2Connected Steiner Minimal Networks," IEEE Transactions on Computers, vol. 61, no. 7, pp. 954968, July, 2012.  
BibTex  x  
@article{ 10.1109/TC.2011.123, author = {Hong Shen and Longkun Guo}, title = {Efficient 2Approximation Algorithms for Computing 2Connected Steiner Minimal Networks}, journal ={IEEE Transactions on Computers}, volume = {61}, number = {7}, issn = {00189340}, year = {2012}, pages = {954968}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2011.123}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Efficient 2Approximation Algorithms for Computing 2Connected Steiner Minimal Networks IS  7 SN  00189340 SP954 EP968 EPD  954968 A1  Hong Shen, A1  Longkun Guo, PY  2012 KW  Survivable network design KW  2vertex (edge) connected Steiner minimal network KW  terminal spanningtree KW  approximation algorithm KW  shortest disjoint path pair KW  Euler walk. VL  61 JA  IEEE Transactions on Computers ER   
[1] V. Auletta, Y. Dinitz, Z. Nutov, and D. Parente, “A 2Approximation Algorithm for Finding an Optimum 3VertexConnected Spanning Subgraph,” J. Algorithms, vol. 32, no. 1, pp. 2130, 1999.
[2] R. Bhandari, “Optimal Physical Diversity Algorithms and Survivable Networks,” Proc. Second IEEE Symp. Computers and Comm., pp. 433441, 1997.
[3] J. Byrka, F. Grandoni, T. Rothvoß, and L. Sanità, “An Improved LPBased Approximation for Steiner Tree,” Proc. 42nd ACM Symp. Theory of Computing, pp. 583592, 2010.
[4] J. Cheriyan, S. Vempala, and A. Vetta, “Approximation Algorithms for MinimumCost KVertex Connected Subgraphs,” Proc. 34th Ann. ACM Symp. Theory of Computing, pp. 306312, 2002.
[5] J. Chuzhoy and S. Khanna, “An $O (k^3 log n)$ Approximation Algorithm for VertexConnectivity Survivable Network Design,” Proc. Ann. IEEE Symp. Foundations of Computer Science, 2009.
[6] Y. Dinitz and Z. Nutov, “A 3Approximation Algorithm for Finding Optimum 4, 5VertexConnected Spanning Subgraphs,” J. Algorithms, vol. 32, no. 1, pp. 3140, 1999.
[7] C.G. Fernandes, “A Better Approximation Ratio for the Minimum KEdgeConnected Spanning Subgraph Problem,” Proc. Eighth Ann. ACMSIAM Symp. Discrete Algorithms, pp. 629638, 1997.
[8] L. Fleischer, “A 2Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity,” Proc. Int'l IPCO Conf. Integer Programming and Combinatorial Optimization, pp. 115129, 2001.
[9] L. Fleischer, K. Jain, and D. Williamson, “An Iterative Rounding 2Approximation 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 2Approximation Algorithms for MinimumCost Vertex Connectivity Problems,” J. Computer and System Sciences, vol. 72, no. 5, pp. 838867, 2006.
[11] H.N. Gabow and S. Gallagher, “Iterated Rounding Algorithms for the Smallest KEdge Connected Spanning Subgraph,” Proc. 19th Ann. ACMSIAM Symp. Discrete Algorithms, pp. 550559, 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. 1340, 1998.
[13] R. Halin, “A Theorem on NConnected Graphs,” J. Combinatorial Theory, vol. 7, no. 2, pp. 150154, 1969.
[14] D.F. Hsu and X.D. Hu, “On Shortest TwoConnected Steiner Networks with Euclidean Distance,” Networks, vol. 32, no. 2, pp. 133140, 1998.
[15] K. Hvam, L. Reinhardt, P. Winter, and M. Zachariasen, “Bounding Component Sizes of TwoConnected Steiner Networks,” Information Processing Letters, vol. 104, no. 5, pp. 159163, 2007.
[16] K. Jain, “A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem,” Combinatorica, vol. 21, no. 1, pp. 3960, 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. 214235, 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 VertexConnectivity Network Design Problems,” Proc. Fifth Int'l Workshop Approximation Algorithms for Combinatorial Optimization, pp. 185199, 2002.
[21] G. Kortsarz and Z. Nutov, “Approximating Node Nonnectivity Problems via Set Covers,” Algorithmica, vol. 37, no. 2, pp. 7592, 2003.
[22] G. Kortsarz and Z. Nutov, “Approximation Algorithm for KNode Connected Subgraphs via Critical Graphs,” Proc. 36th Ann. ACM Symp. Theory of Computing, pp. 138145, 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. 141145, 1981.
[25] E.L. Luebke and J.S. Provan, “On the Structure and Complexity of the 2Connected Steiner Network Problem in the Plane,” Operations Research Letters, vol. 26, no. 3, pp. 111116, 2000.
[26] Z. Nutov, “An Almost O (log k)Approximation for KConnected Subgraphs,” Proc. 19th Ann. ACMSIAM Symp. Discrete Algorithms, pp. 912921, 2009.
[27] Z. Nutov, “Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and SpiderCover Decompositions,” Proc. 50th Ann. IEEE Symp. Foundations of Computer Science (FOCS '09), pp. 417426, 2010.
[28] R. Ravi, “An Approximation Algorithm for MinimumCost VertexConnectivity Problems,” Algorithmica, vol. 18, no. 1, pp. 2143, 1997.
[29] R. Ravi and D.P. Williamson, “Erratum: An Approximation for MinimumCost VertexConnectivity Problems,” Proc. 13th Ann. ACMSIAM Symp. Discrete Algorithms, pp. 10001001, 2002.
[30] G. Robins and A. Zelikovsky, “Tighter Bounds for Graph Steiner Tree Approximation,” SIAM J. Discrete Math., vol. 19, no. 1, pp. 122134, 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. 325336, 1984.
[32] D.P. Williamson, “The PrimalDual Method for Approximation Algorithms,” Math. Programming, vol. 91, no. 3, pp. 447478, 2002.
[33] P. Winter and M. Zachariasen, “TwoConnected Steiner Networks: Structural Properties,” Operations Research Letters, vol. 33, no. 4, pp. 395402, 2005.