Iterated rounding algorithms for the smallest k-edge connected spanning subgraph

@inproceedings{Gabow2008IteratedRA,
title={Iterated rounding algorithms for the smallest k-edge connected spanning subgraph},
author={Harold N. Gabow and Suzanne Gallagher},
booktitle={SODA},
year={2008}
}

We present the best known algorithms for approximating the minimum cardinality undirected k-edge connected spanning subgraph. For simple graphs our approximation ratio is 1 + 1/2k + <i>O</i>(1/k<sup>2</sup>). The more precise version of our bound requires <i>k</i> ≥ 7, and for all such <i>k</i> it improves the longstanding bound of Cheriyan and Thurimella, 1 + 2/(<i>k</i> + 1) [2]. The improvement comes in two steps: First we show that for simple <i>k</i>-edge connected graphs, any laminar… CONTINUE READING