Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Berger, A., & Grigni, M. (2007). Minimum weight 2-edge-connected spanning subgraphs in planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4596 LNCS, pp. 90–101). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
