The Two-Edge Connectivity Survivable Network Problem in Planar Graphs

DOI10.1007/978-3-540-70575-8_40MaRDI QIDQ3521942zbMATH OpenOpenAlexFDO

Authors Glencora Borradaile, Philip N. Klein

Publication date 28 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70575-8_40

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• The two-edge connectivity survivable-network design problem in planar graphs
• A PTAS for three-edge-connected survivable network design in planar graphs
• Algorithms – ESA 2005
• Two-Connected Augmentation Problems in Planar Graphs
• Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs

Cited in

(7)

• Defending planar graphs against star-cutsets
• Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
• The two-edge connectivity survivable-network design problem in planar graphs
• A PTAS for three-edge-connected survivable network design in planar graphs
• Algorithms – ESA 2005
• Global minimum cuts in surface embedded graphs
• Correlation clustering and two-edge-connected augmentation for planar graphs

This page was built for publication: The Two-Edge Connectivity Survivable Network Problem in Planar Graphs

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