Approximating rooted connectivity augmentation problems
From MaRDI portal
Publication:2492636
DOI10.1007/S00453-005-1150-5zbMath1088.05047OpenAlexW4252495556MaRDI QIDQ2492636
Publication date: 14 June 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-005-1150-5
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Connectivity (05C40)
Related Items (5)
Approximating subset \(k\)-connectivity problems ⋮ Approximating node-connectivity augmentation problems ⋮ Tight approximation algorithm for connectivity augmentation problems ⋮ A note on Rooted Survivable Networks ⋮ Inapproximability of survivable networks
This page was built for publication: Approximating rooted connectivity augmentation problems
