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

Harold N. Gabow, Michel X. Goemans, Éva Tardos, David P. Williamson. Approximating the smallest ::::k::::-edge connected spanning subgraph by LP-rounding. Networks, 53(4):345-357, 2009. [doi]

Abstract

Abstract is missing.