  We provide algorithms for the minimum 2-edge-connected spanning subgraph
problem and the minimum 2-vertex-connected spanning subgraph problem with
approximation ratio both $\frac{4}{3}$. Using a common theme, the algorithms
and their analyses are very similar.
