Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs

Joseph Cheriyan, László A. Végh. Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA. pages 30-39, IEEE Computer Society, 2013. [doi]

Abstract

Abstract is missing.