Dinitz, Yefim Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Nutov, Zeev Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Auletta, V., Dinitz, Y., Nutov, Z., & Parente, D. (1999). A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph. Journal of Algorithms, 32(1), 21-30.