A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
The Two-Edge Connectivity Survivable Network Problem in Planar Graphs
[chapter]
2008
Lecture Notes in Computer Science
Consider the following problem: given a graph with edgeweights and a subset Q of vertices, find a minimum-weight subgraph in which there are two edge-disjoint paths connecting every pair of vertices in Q. The problem is a failure-resilient analog of the Steiner tree problem, and arises in telecommunications applications. A more general formulation, also employed in telecommunications optimization, assigns a number (or requirement) rv ∈ {0, 1, 2} to each vertex v in the graph; for each pair u, v
doi:10.1007/978-3-540-70575-8_40
fatcat:krfe44tyjna25e4cpasvhm2cma