Approximating Node-Connectivity Augmentation Problems
From MaRDI portal
Recommendations
Cited in
(15)- A note on the vertex-connectivity augmentation problem
- Augmenting weighted graphs to establish directed point-to-point connectivity
- Approximating node-connectivity augmentation problems
- Approximating connectivity augmentation problems
- Approximating connectivity augmentation problems
- Tight Approximation Algorithm for Connectivity Augmentation Problems
- scientific article; zbMATH DE number 5535213 (Why is no real title available?)
- scientific article; zbMATH DE number 1256717 (Why is no real title available?)
- Minimum Cardinality Point-to-point Connectivity Augmentation Problem
- Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
- Primal-dual approach for directed vertex connectivity augmentation and generalizations
- Approximation algorithms for graph augmentation
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
- Tight approximation algorithm for connectivity augmentation problems
- A note on Rooted Survivable Networks
This page was built for publication: Approximating Node-Connectivity Augmentation Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638884)