Approximating the smallest $k$-edge connected spanning subgraph by LP-rounding.

Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson
Network Design
DOI
Type
Journal article
Publication
Networks 53:345-357, 2009.