论文信息 - Factor 4/3 approximations for minimum 2-connected subgraphs

Factor 4/3 approximations for minimum 2-connected subgraphs

We present factor 4/3 approximation algorithms for the problems of finding theminimum 2-edge connected and theminimum 2-vertex connected spanning subgraph of a given undirected graph.

Santosh S. Vempala | Adrian Vetta

[1] Santosh S. Vempala,et al. Improved approximation algorithms for biconnected subgraphs via better lower bounding techniques , 1993, SODA '93.

[2] Zoltán Szigeti,et al. Improving on the 1.5-Approximation of a Smallest 2-Edge Connected Spanning Subgraph , 2001, SIAM J. Discret. Math..

[3] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .

[4] R. Ravi,et al. A New Bound for the 2-Edge Connected Subgraph Problem , 1998, IPCO.