John Turek, Walter Ludwig, et al.
SPAA 1994
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
Don Coppersmith, Lisa Fleischer, et al.
SODA 2006
Kamal Jain, Ion Mǎndoiu, et al.
Journal of Algorithms
Alok Aggarwal, Jon Kleinberg, et al.
STOC 1996