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]

Authors

Harold N. Gabow

This author has not been identified. Look up 'Harold N. Gabow' in Google

Michel X. Goemans

This author has not been identified. Look up 'Michel X. Goemans' in Google

Éva Tardos

This author has not been identified. Look up 'Éva Tardos' in Google

David P. Williamson

This author has not been identified. Look up 'David P. Williamson' in Google