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 is series-parallel. We also discuss related polyhedra.
No takes yet. Share an insight, caveat, or question.
Baı̈ou et al. (1997) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:
More from SIAM Journal on Discrete Mathematics