Sciweavers

Share
ESA
2005
Springer

Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs

9 years 9 months ago
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
Abstract. 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 + ε)-spanner of G with total weight bounded by weight(A)/ε. From this we derive quasi-polynomial time approximation schemes for the problems of finding the minimum-weight 2-edge-connected or biconnected spanning subgraph in planar graphs. We also design approximation schemes for the minimum-weight 1-2-connectivity problem, which is the variant of the survivable network design problem where vertices have non-uniform (1 or 2) connectivity constraints. Prior to our work, for all these...
André Berger, Artur Czumaj, Michelangelo Gr
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where ESA
Authors André Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao
Comments (0)
books