Two-connected spanning subgraphs with at most $\frac{10}{7}$OPT edges
  We present a $\frac{10}{7}$-approximation algorithm for the minimum two-vertex-connected spanning subgraph problem. 
Klaus Heeger and Jens Vygen
math.CO cs.DM cs.DS