A 4 + ε approximation for k-connected subgraphs

DOI10.1137/1.9781611975994.60OpenAlexW2911783023MaRDI QIDQ5146831

Zeev Nutov

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975994.60

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Node connectivity augmentation via iterative randomized rounding ⋮ Approximating k-Connected m-Dominating Sets ⋮ Approximation algorithms for vertex-connectivity augmentation on the cycle

This page was built for publication: A 4 + ε approximation for k-connected subgraphs