Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
From MaRDI portal
(Redirected from Publication:6156028)
Recommendations
- Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree
- Approximation algorithms for connectivity augmentation problems
- Approximating Node-Connectivity Augmentation Problems
- Approximating node-connectivity augmentation problems
- scientific article; zbMATH DE number 1979495
- Improved approximation algorithms for min-cost connectivity augmentation problems
- Approximating connectivity augmentation problems
- Approximating connectivity augmentation problems
- Tight approximation algorithm for connectivity augmentation problems
- Tight Approximation Algorithm for Connectivity Augmentation Problems
Cites work
- scientific article; zbMATH DE number 1003253 (Why is no real title available?)
- scientific article; zbMATH DE number 6850362 (Why is no real title available?)
- scientific article; zbMATH DE number 1405806 (Why is no real title available?)
- 2-node-connectivity network design
- A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- A 4/3-approximation algorithm for the minimum 2-edge connected subgraph problem
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
- Approximating (unweighted) tree augmentation via lift-and-project. II
- Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
- Approximation Algorithms for Graph Augmentation
- Approximation Algorithms for Several Graph Augmentation Problems
- Approximation algorithms for connectivity augmentation problems
- Beating approximation factor two for weighted tree augmentation with bounded costs
- 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
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
- Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
- Improved approximation for tree augmentation: saving by rewiring
- Iterated rounding algorithms for the smallest k-edge connected spanning subgraph
- Node connectivity augmentation via iterative randomized rounding
- On the cycle augmentation problem: hardness and approximation algorithms
- On the tree augmentation problem
- Parameterized algorithms to preserve connectivity
- Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
- Steiner tree approximation via iterative randomized rounding
- Tighter Bounds for Graph Steiner Tree Approximation
Cited in
(6)- 2-node-connectivity network design
- Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation
- Approximation algorithms for node and element connectivity augmentation problems
- On the bidirected cut relaxation for Steiner forest
- Survivable network design with group-to-group requirement
- A 4/3 approximation for 2-vertex-connectivity
This page was built for publication: Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156028)
