A (1+ 2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
From MaRDI portal
Publication:388116
Recommendations
- A (1 + 2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
- A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- scientific article; zbMATH DE number 1979495
- A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- Minimum augmentation of a tree to a K-edge-connected graph
- Algorithms for radius-optimally augmenting trees in a metric space
- Algorithms for radius-optimally augmenting trees in a metric space
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems
- Improved approximation algorithms for min-cost connectivity augmentation problems
Cites work
- A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- A factor 2 approximation algorithm for the generalized Steiner network problem
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Covering a laminar family by leaf to leaf links
- scientific article; zbMATH DE number 1405806 (Why is no real title available?)
- On the integrality ratio for tree augmentation
- On the relationship between the biconnectivity augmentation and traveling salesman problems
Cited in
(28)- LP-relaxations for tree augmentation
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
- Approximating Steiner trees and forests with minimum number of Steiner points
- Approximation algorithms for vertex-connectivity augmentation on the cycle
- On small-depth tree augmentations
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
- 2-node-connectivity network design
- A simple LP-based approximation algorithm for the matching augmentation problem
- On the cycle augmentation problem: hardness and approximation algorithms
- On the tree augmentation problem
- A (1 + 2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
- Approximating Steiner trees and forests with minimum number of Steiner points
- scientific article; zbMATH DE number 7205039 (Why is no real title available?)
- An Improved Approximation Algorithm for the Matching Augmentation Problem
- Node connectivity augmentation via iterative randomized rounding
- On a partition LP relaxation for min-cost 2-node connected spanning subgraphs
- 2-node-connectivity network design
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
- A (1.5+)-approximation algorithm for weighted connectivity augmentation
- 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 constrained Steiner strong connectivity augmentation problem
- A 4/3 approximation for 2-vertex-connectivity
- Better-than-2 approximations for weighted tree augmentation and applications to Steiner tree
- Approximation algorithms for Steiner connectivity augmentation
- Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
- Approximation schemes for planar graph connectivity problems
- Covering a laminar family by leaf to leaf links
This page was built for publication: A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388116)
