Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
- Cite this paper as:
- Berger A., Grigni M. (2007) Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs. In: Arge L., Cachin C., Jurdziński T., Tarlecki A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg
We present a linear time algorithm exactly solving the 2-edge connected spanning subgraph (2-ECSS) problem in a graph of bounded treewidth. Using this with Klein’s diameter reduction technique , we find a linear time PTAS for the problem in unweighted planar graphs, and the first PTAS for the problem in weighted planar graphs.
Unable to display preview. Download preview PDF.