Abstract
The minimum cardinality 2-connected spanning subgraph problem is considered. An approximation algorithm with a performance ratio of 9/7 ≈ 1.286 is presented. This improves the previous best ratio of 4/3 for the problem. An approximation algorithm with a performance ratio of 5/4 in graphs with a minimum-degree of three at every node is also presented. This class includes all 3-connected graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cheriyan, J., Sebő, A., Szigeti, Z.: Improving on the 1.5 approximation of a smallest 2-edge connected spanning subgraph. SIAM J. Discret. Math. 14, 170–180 (2001)
Cheriyan, J., Vempala, S., Vetta, A.: Approximation algorithms for minimum-cost k-connected subgraphs. In: Proc. of the 34th ACM Symposium on the Theory of Computing, STOC (2002)
Cheriyan, J., Thurimella, R.: Approximating minimum-size k-connected spanning subgraphs via Matching. SIAM J. Comput. 30, 528–560 (2000)
Fernandes, C.G.: A better approximation for the minimum k-edge-connected spanning subgraph problem. J. Algorithms 28, 105–124 (1998)
Gabow, H.N.: An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph. SIAM J. Disc. Math. 18(1), 41–70 (2004)
Gabow, H.N.: Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph. In: Proc. 14th Annual ACM-SIAM Symp. on Discret. Algorithms, SODA (2003)
Garg, N., Santosh, V., Singla, A.: Improved approximation algorithms for biconnected subgraphs via better lower bounding techniques. In: Proc. 4th Annual ACM-SIAM Symp. on Discret. Algorithms (SODA), pp. 103–111 (1993)
Hartvigsen, D.: Extensions of matching theory, Ph.D. Thesis, Carnegie-Mellon University (1984)
Hartvigsen, D.: The square-free 2-factor problem in bipartite graphs. In: Proc. of the 7th Integer Programming and Combinatorial Optimization Conference (IPCO), pp. 234–241 (1999)
Jothi, R., Raghavachari, B., Varadarajan, S.: A 5/4-approximation algorithm for minimum 2-edge-connectivity. In: Proc. 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 725–734 (2003)
Khuller, S., Raghavachari, B.: Improved approximation algorithms for uniform connectivity problems. J. Algorithms 21, 433–450 (1996)
Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. J. Assoc. Comput. Mach. 41, 214–235 (1994)
Krysta, P., Anil Kumar, V.S.: Approximation algorithms for minimum size 2-connectivity problems. In: Proc. 18th Intl. Symposium on Theoretical Aspects of Computer Science (STACS), pp. 431–442 (2001)
Nagamochi, H., Ibaraki, T.: Linear time algorithms for finding sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7, 583–596 (1992)
Vempala, S., Vetta, A.: Factor 4/3 approximations for minimum 2-connected subgraphs. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 262–273. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gubbala, P., Raghavachari, B. (2005). Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem. In: Jünger, M., Kaibel, V. (eds) Integer Programming and Combinatorial Optimization. IPCO 2005. Lecture Notes in Computer Science, vol 3509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496915_31
Download citation
DOI: https://doi.org/10.1007/11496915_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26199-5
Online ISBN: 978-3-540-32102-6
eBook Packages: Computer ScienceComputer Science (R0)