A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
[chapter]
2005
Lecture Notes in Computer Science
We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are resistant to edge or vertex removal. We first give a PTAS for the problem of finding minimum-weight 2-edge-connected spanning subgraphs where duplicate edges are allowed. Then we present a new greedy spanner construction for edge-weighted planar graphs, which augments any connected subgraph A of a weighted planar graph G to a (1 +
doi:10.1007/11561071_43
fatcat:m565l4ypivaafiuyt6vvzq5goe