Parameterized algorithms for node connectivity augmentation problems
From MaRDI portal
Cites work
- 2-node-connectivity network design
- A (1.5+)-approximation algorithm for weighted connectivity augmentation
- A 4+ approximation for k-connected subgraphs
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
- A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A polylogarithmic approximation algorithm for 2-edge-connected dominating set
- An O(k^3 n)-approximation algorithm for vertex-connectivity survivable network design
- An application of submodular flows
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
- Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs
- Approximating minimum-cost connectivity problems via uncrossable bifamilies
- Approximating minimum-cost edge-covers of crossing biset-families
- Approximating node connectivity problems via set covers
- Approximating rooted connectivity augmentation problems
- Augmenting undirected node-connectivity by one
- Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree
- Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
- Coverings and structure of crossing families
- Dynamic programming for minimum Steiner trees
- Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen
- Fast exact algorithms for survivable network design with uniform requirements
- Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
- scientific article; zbMATH DE number 1263227 (Why is no real title available?)
- scientific article; zbMATH DE number 6865614 (Why is no real title available?)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems
- Improved Approximation Algorithms for Uniform Connectivity Problems
- Independence free graphs and vertex connectivity augmentation
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Kernelization and complexity results for connectivity augmentation problems
- Local search for weighted tree augmentation and Steiner tree
- On the tree augmentation problem
- Parameterized algorithms for survivable network design with uniform demands
- Parameterized algorithms to preserve connectivity
- Path-contractions, edge deletions and connectivity preservation
- Rooted \(k\)-connections in digraphs
- The complexity landscape of fixed-parameter directed Steiner network problems
- The parameterized complexity of the survivable network design problem
- The steiner problem in graphs
This page was built for publication: Parameterized algorithms for node connectivity augmentation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253161)
