Approximating connectivity augmentation problems
From MaRDI portal
Recommendations
- Approximating connectivity augmentation problems
- Approximation algorithms for connectivity augmentation problems
- Approximating Node-Connectivity Augmentation Problems
- Approximating node-connectivity augmentation problems
- Tight approximation algorithm for connectivity augmentation problems
- Tight Approximation Algorithm for Connectivity Augmentation Problems
- scientific article; zbMATH DE number 1263261
- Approximating rooted connectivity augmentation problems
- Approximating rooted connectivity augmentation problems
- Matching Based Augmentations for Approximating Connectivity Problems
Cited in
(26)- Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs
- Inapproximability of survivable networks
- A note on the vertex-connectivity augmentation problem
- On the cycle augmentation problem: hardness and approximation algorithms
- Approximating node-connectivity augmentation problems
- A unifying approach to splitting-off
- Approximating rooted connectivity augmentation problems
- Approximating connectivity augmentation problems
- Edge-connectivity augmentations of~graphs~and~hypergraphs
- Tight Approximation Algorithm for Connectivity Augmentation Problems
- Approximating Node-Connectivity Augmentation Problems
- scientific article; zbMATH DE number 1757953 (Why is no real title available?)
- Approximating Minimum Cost Connectivity Orientation and Augmentation
- Minimum Cardinality Point-to-point Connectivity Augmentation Problem
- Primal-dual approach for directed vertex connectivity augmentation and generalizations
- Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree
- Approximating Steiner Networks with Node Weights
- Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time
- On algebraic connectivity augmentation
- Approximating rooted connectivity augmentation problems
- Node connectivity augmentation via iterative randomized rounding
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
- Tight approximation algorithm for connectivity augmentation problems
- Local edge-connectivity augmentation in hypergraphs is NP-complete
- A note on Rooted Survivable Networks
This page was built for publication: Approximating connectivity augmentation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921668)
