Dinitz, Yefim Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Nutov, Zeev Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Dinitz, Y., & Nutov, Z. (1999). A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs. Journal of Algorithms, 32(1), 21-30.