The Two-Edge Connectivity Survivable Network Problem in Planar Graphs
From MaRDI portal
Publication:3521942
DOI10.1007/978-3-540-70575-8_40zbMath1153.68565OpenAlexW2570240585MaRDI QIDQ3521942
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
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)
Related Items (4)
Correlation clustering and two-edge-connected augmentation for planar graphs ⋮ Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs ⋮ A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs ⋮ Unnamed Item
This page was built for publication: The Two-Edge Connectivity Survivable Network Problem in Planar Graphs