The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs

DOI10.1145/2831235zbMath1445.68152arXiv1302.2184OpenAlexW2144241285MaRDI QIDQ4962608

Glencora Borradaile, Philip N. Klein

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.2184

zbMATH Keywords

planar graphspolynomial-time approximation schemesurvivable network design

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Approximation algorithms (68W25) Connectivity (05C40)

Related Items (2)

A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs ⋮ A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs

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