On the dominant of the Steiner 2-edge connected subgraph polytope

Given a graph G = (V, E) with weights on its edges and a set of specified n odes S subset of or equal to V, the Steiner 2-edge connected subgraph probl em is to find a minimum weight 2-edge connected subgraph of G, spanning S. This problem has applications to the design of reliable communication and t ransportation networks. In this paper we give a complete linear description of the dominant of the associated polytope in a class of graphs called per fectly Steiner 2-edge connected graphs, which contains series-parallel grap hs. We also discuss related polyhedra. (C) 2001 Elsevier Science B.V. All r ights reserved.