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}
}
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

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Maximal flow through a network

  • L. R. Ford, D. R. Fulkerson
  • Can. J. Math., 8
  • 1956
Highly Influential
2 Excerpts

Le problème du sous graphe Steiner 2-arête connexe: Approche polyédrale

  • M. Bäıou
  • Ph.D. dissertation, N 1639, Université de Rennes…
  • 1993
1 Excerpt

Similar Papers

Loading similar papers…