1. Better algorithms for minimum-weight connectivity problems;Auletta,1997
2. Extremal Graph Theory;Bollobás,1978
3. Approximating minimum-size k-connected spanning subgraphs via matching;Cheriyan,1996
4. A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs;Dinitz;J. Algorithms,1999
5. Finding minimum weight k-vertex connected spanning subgraphs: approximation algorithms with factor 2 for k=3 and factor 3 for k=4,5;Dinitz,1997