2007 | OriginalPaper | Chapter
Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
Authors : André Berger, Michelangelo Grigni
Published in: Automata, Languages and Programming
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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 [15], we find a linear time PTAS for the problem in unweighted planar graphs, and the first PTAS for the problem in weighted planar graphs.