Don Coppersmith, Lisa Fleischer, et al.
SODA 2006
Paper
An iterative rounding 2-approximation algorithm for the element connectivity problem
Abstract
An iterative rounding 2-approximation algorithm for the element connectivity problem was studied. The set of vertices was partitioned into terminals and nonterminals in the element connectivity problem. The variants of survivable network design problem (SNDP) are all known to be NP-hard. It was observed that the best approximation algorithm for the EC-SNDP showed performance guarantee of 2 and iteratively rounds solutions to a linear programming relaxation of the problem.
Related
Michel X. Goemans, David P. Williamson
Journal of Computer and System Sciences
Conference paper
Faster approximation algorithms for the minimum latency problem
Aaron Archer, David P. Williamson
SODA 1998
Sanjeev Khanna, Madhu Sudan, et al.
SIAM Journal on Computing