Approximating node-connectivity augmentation problems
From MaRDI portal
Recommendations
- Approximating Node-Connectivity Augmentation Problems
- Approximating connectivity augmentation problems
- Approximating connectivity augmentation problems
- Approximation algorithms for connectivity augmentation problems
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems
- Tight Approximation Algorithm for Connectivity Augmentation Problems
- Tight approximation algorithm for connectivity augmentation problems
- Improved approximation algorithms for min-cost connectivity augmentation problems
- scientific article; zbMATH DE number 1263261
- Approximating rooted connectivity augmentation problems
Cites work
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A note on the vertex-connectivity augmentation problem
- An application of submodular flows
- An approximation algorithm for minimum-cost vertex-connectivity problems
- An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
- Approximating connectivity augmentation problems
- Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
- Approximating node connectivity problems via set covers
- Approximating Node-Connectivity Augmentation Problems
- Approximating rooted connectivity augmentation problems
- Approximation Algorithms for Directed Steiner Problems
- Approximation Algorithms for Network Design with Metric Costs
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Augmenting undirected node-connectivity by one
- Design networks with bounded pairwise distance
- Edge-connection of graphs, digraphs, and hypergraphs
- Hardness of Approximation for Vertex-Connectivity Network Design Problems
- scientific article; zbMATH DE number 5485528 (Why is no real title available?)
- scientific article; zbMATH DE number 2080256 (Why is no real title available?)
- Improved approximation algorithms for directed Steiner forest
- Inapproximability of survivable networks
- Independence free graphs and vertex connectivity augmentation
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Minimal edge-coverings of pairs of sets
- On shredders and vertex connectivity augmentation
- On the optimal vertex-connectivity augmentation
- On the ratio of optimal integral and fractional covers
- Polylogarithmic inapproximability
- Tight approximation algorithm for connectivity augmentation problems
Cited in
(20)- A note on the vertex-connectivity augmentation problem
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems
- Approximating subset \(k\)-connectivity problems
- Approximating minimum cost source location problems with local vertex-connectivity demands
- Approximating source location and star survivable network 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?)
- Approximating Node-Connectivity Augmentation Problems
- 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
- Approximation algorithms for graph augmentation
- Approximating source location and star survivable network problems
- Improved approximation algorithms for min-cost connectivity augmentation problems
- On rooted node-connectivity problems
- Node connectivity augmentation via iterative randomized rounding
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
- Tight approximation algorithm for connectivity augmentation problems
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 Q2429349)
