Joseph Cheriyan Ramakrishna Thurimella Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching Electronic Colloquium on Computational Complexity (ECCC) 1998 25 5 db/journals/eccc/eccc5.html#ECCC-TR98-025