Approximation algorithms for Steiner connectivity augmentation

Cites work

A 4/3-approximation algorithm for the minimum 2-edge connected subgraph problem
A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
A better-than-2 approximation for weighted tree augmentation
A factor 2 approximation algorithm for the generalized Steiner network problem
A primal-dual approximation algorithm for generalized Steiner network problems
An approximation algorithm for two-edge-connected subgraph problem via triangle-free two-edge-cover
Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
Approximating (unweighted) tree augmentation via lift-and-project. II
Approximating Steiner networks with node-weights
Approximation Algorithms for Several Graph Augmentation Problems
Approximation algorithms for Steiner tree augmentation problems
Breaching the 2-approximation barrier for the forest augmentation problem
Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
Hardness of Approximation for Vertex-Connectivity Network Design Problems
Improved Approximation for Two-Edge-Connectivity
Local search for weighted tree augmentation and Steiner tree
On the cycle augmentation problem: hardness and approximation algorithms
On the integrality ratio for tree augmentation
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
The connectivity carcass of a vertex subset in a graph and its incremental maintenance
The steiner problem in graphs
Thek-Steiner Ratio in Graphs

This page was built for publication: Approximation algorithms for Steiner connectivity augmentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253131)