Journal: Electronic Colloquium on Computational Complexity (ECCC)

Volume 5, Issue 25

0 -- 0Joseph Cheriyan, Ramakrishna Thurimella. Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching