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

Joseph Cheriyan, Ramakrishna Thurimella

Browse the full FOCS paper archive.