We consider the analysis of linear programming (LP) relaxations for a class of connectivity problems. The central problem in the class is the survivable network design problem the problem of designing a minimum cost undirected network satisfying prespecified connectivity requirements between every pair of vertices. This class includes a number of classical combinatorial optimization problems as...