Highly Influenced

# Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs

@article{Baou1997Steiner2C, title={Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs}, author={Mourad Ba{\"i}ou and Ali Ridha Mahjoub}, journal={SIAM J. Discrete Math.}, year={1997}, volume={10}, pages={505-514} }

- Published 1997 in SIAM J. Discrete Math.
DOI:10.1137/S0895480193259813

Given a graph G = (V,E) with weights on its edges and a set of specified nodes S ⊆ V , the Steiner 2-edge survivable network problem is to find a minimum weight subgraph of G such that between every two nodes of S there are at least two edge-disjoint paths. This problem has applications to the design of reliable communication and transportation networks. In this paper, we give a complete linear description of the polytope associated with the solutions to this problem when the underlying graph… CONTINUE READING

Highly Cited

This paper has 19 citations. REVIEW CITATIONS