Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract).

Joseph Cheriyan Ramakrishna Thurimella Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching (extended abstract). 292-301 1996 FOCS db/conf/focs/focs96.html#CheriyanT96