Approximation algorithms for node and element connectivity augmentation problems
From MaRDI portal
Cites work
- 2-node-connectivity network design
- A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- A (1.5+)-approximation algorithm for weighted connectivity augmentation
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
- A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- A unifying approach to splitting-off
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
- Approximating activation edge-cover and facility location problems
- Approximating connectivity augmentation problems
- Approximating minimum-cost edge-covers of crossing biset-families
- Approximation Algorithms for Graph Augmentation
- Approximation Algorithms for Several Graph Augmentation Problems
- Augmenting hypergraphs by edges of size two
- Beating approximation factor two for weighted tree augmentation with bounded costs
- Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation
- 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
- Connections in combinatorial optimization
- Covering a laminar family by leaf to leaf links
- Covering symmetric supermodular functions by graphs
- Coverings and structure of crossing families
- scientific article; zbMATH DE number 1263227 (Why is no real title available?)
- scientific article; zbMATH DE number 6850362 (Why is no real title available?)
- Improved approximation for tree augmentation: saving by rewiring
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Local edge-connectivity augmentation in hypergraphs is NP-complete
- Local search for weighted tree augmentation and Steiner tree
- Node connectivity augmentation via iterative randomized rounding
- On the cycle augmentation problem: hardness and approximation algorithms
- On the integrality ratio for tree augmentation
- On the tree augmentation problem
- Parameterized algorithms to preserve connectivity
- Steiner tree approximation via iterative randomized rounding
This page was built for publication: Approximation algorithms for node and element connectivity augmentation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635706)
