An o(log<sup>2</sup> k)-approximation algorithm for the k-vertex connected spanning subgraph problem.

Jittat Fakcharoenphol Bundit Laekhanukit An o(log<sup>2</sup> k)-approximation algorithm for the k-vertex connected spanning subgraph problem. 153-158 2008 STOC http://doi.acm.org/10.1145/1374376.1374401 conf/stoc/2008 db/conf/stoc/stoc2008.html#FakcharoenpholL08