Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs

MaRDI QIDQ5501298zbMATH OpenFDO

Authors Hairong Zhao, Artur Czumaj, Michelangelo Grigni, Papa A. Sissokho

Publication date 3 August 2015

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Recommendations

• Algorithms – ESA 2005
• Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
• scientific article; zbMATH DE number 1688381
• On finding two-connected subgraphs in planar graphs
• Biconnectivity approximations and graph carvings

Cited in

(11)

• scientific article; zbMATH DE number 1688381 (Why is no real title available?)
• Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
• The Two-Edge Connectivity Survivable Network Problem in Planar Graphs
• A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs
• The two-edge connectivity survivable-network design problem in planar graphs
• On finding two-connected subgraphs in planar graphs
• Algorithms – ESA 2005
• A PTAS for three-edge-connected survivable network design in planar graphs
• Survivable network design for group connectivity in low-treewidth graphs
• Connected feedback vertex set in planar graphs
• Approximation algorithms via contraction decomposition

This page was built for publication: Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501298)