The following publications are possibly variants of this publication:
- An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a MultigraphHarold N. Gabow. siamdm, 19(1):1-18, 2005. [doi]
- Approximating the smallest ::::k::::-edge connected spanning subgraph by LP-roundingHarold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson. networks, 53(4):345-357, 2009. [doi]
- Approximating the smallest ::::k::::-edge connected spanning subgraph by LP-roundingHarold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson. soda 2005: 562-571 [doi]
- Iterated rounding algorithms for the smallest ::::k::::-edge connected spanning subgraphHarold N. Gabow, Suzanne Gallagher. soda 2008: 550-559 [doi]
- k-Edge Connected Spanning SubgraphHarold N. Gabow, Suzanne Gallagher. SICOMP, 41(1):61-103, 2012. [doi]
- Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraphHarold N. Gabow. soda 2003: 460-469 [doi]
- An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraphHarold N. Gabow. soda 2002: 84-93 [doi]