Approximation algorithms for solving the constrained strong Steiner connectivity augmentation problem

Cites work

$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
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
A ${(1+\ln 2)}$-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
A good algorithm for edge-disjoint branching
A matroid approach to finding edge connectivity and packing arborescences
An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
Approximation Algorithms for Directed Steiner Problems
Approximation algorithms for flexible graph connectivity
Approximation Algorithms for Graph Augmentation
Approximation Algorithms for Several Graph Augmentation Problems
Arborescence problems in directed graphs: theorems and algorithms
Augmentation Problems
Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
Combinatorial optimization. Theory and algorithms
How to Secure Matchings against Edge Failures
scientific article; zbMATH DE number 3827200 (Why is no real title available?)
scientific article; zbMATH DE number 1219584 (Why is no real title available?)
Smallest Augmentations to Biconnect a Graph
Steiner tree approximation via iterative randomized rounding
Strong connectivity in directed graphs under failures, with applications
Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree
The Steiner problem with edge lengths 1 and 2
Tighter Bounds for Graph Steiner Tree Approximation

This page was built for publication: Approximation algorithms for solving the constrained strong Steiner connectivity augmentation problem

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