Approximation algorithms for node and element connectivity augmentation problems

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
Approximating minimum-cost edge-covers of crossing biset-families
Local edge-connectivity augmentation in hypergraphs is NP-complete
Covering a laminar family by leaf to leaf links
On the integrality ratio for tree augmentation
Augmenting hypergraphs by edges of size two
Covering symmetric supermodular functions by graphs
Coverings and structure of crossing families
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
2-node-connectivity network design
Approximating activation edge-cover and facility location problems
On the cycle augmentation problem: hardness and approximation algorithms
A unifying approach to splitting-off
Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
On the tree augmentation problem
Approximating connectivity augmentation problems
Approximation Algorithms for Several Graph Augmentation Problems
Approximation Algorithms for Graph Augmentation
Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
Parameterized Algorithms to Preserve Connectivity
Improved approximation for tree augmentation: saving by rewiring
Steiner Tree Approximation via Iterative Randomized Rounding
Node connectivity augmentation via iterative randomized rounding
Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
A \((1.5+\varepsilon)\)-approximation algorithm for weighted connectivity augmentation
Local search for weighted tree augmentation and Steiner tree
Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation

This page was built for publication: Approximation algorithms for node and element connectivity augmentation problems