On the Hardness and Approximability of Planar Biconnectivity Augmentation
From MaRDI portal
Publication:5323069
DOI10.1007/978-3-642-02882-3_25zbMath1248.68381WikidataQ56977195 ScholiaQ56977195MaRDI QIDQ5323069
Bernd Zey, Petra Mutzel, Carsten Gutwenger
Publication date: 23 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_25
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
Related Items
Augmenting the edge connectivity of planar straight line graphs to three, Connectivity augmentation in planar straight line graphs, Minimum weight connectivity augmentation for planar straight-line graphs, Triangulating Planar Graphs While Keeping the Pathwidth Small
Cites Work