Approximation Schemes for Minimum 2-Edge-Connected and Biconnected Subgraphs in Planar Graphs

Document Type

Conference Proceeding

Publication Date

4-15-2004

Abstract

Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2-vertex-connected (biconnected) spanning subgraph is MaxSNP-hard, We show that for planar graphs, both problems have a polynomial time approximation scheme (PTAS) with running time n O(1/ε), where n is the graph size and ε is the relative error allowed. When the planar graph has edge costs, we approximately solve the analogous min-cost subgraph problems in time nO(γ/ε), where γ is the ratio of the total edge cost to the optimum solution cost.

Identifier

1842592037 (Scopus)

Publication Title

Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

First Page

489

Last Page

498

Volume

15

This document is currently not available here.

Share

COinS