Approximating fault-tolerant group-Steiner problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1003253 (Why is no real title available?)
- scientific article; zbMATH DE number 5485528 (Why is no real title available?)
- scientific article; zbMATH DE number 1757947 (Why is no real title available?)
- scientific article; zbMATH DE number 1775400 (Why is no real title available?)
- scientific article; zbMATH DE number 219265 (Why is no real title available?)
- scientific article; zbMATH DE number 6297807 (Why is no real title available?)
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A Parallel Repetition Theorem
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- A factor 2 approximation algorithm for the generalized Steiner network problem
- A series of approximation algorithms for the acyclic directed Steiner tree problem
- A tight bound on approximating arbitrary metrics by tree metrics
- An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
- An almost \(O(\log k)\)-approximation for \(k\)-connected subgraphs
- An improved LP-based approximation for Steiner tree
- Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
- Approximating Steiner Networks with Node Weights
- Approximating the weight of shallow Steiner trees
- Approximation Algorithms for Directed Steiner Problems
- Buy-at-bulk network design with protection
- Hardness of Approximation for Vertex-Connectivity Network Design Problems
- Inapproximability of survivable networks
- Lower-Stretch Spanning Trees
- On the hardness of approximating spanners
- Pruning 2-connected graphs
- Saving an epsilon: a 2-approximation for the \(k\)-MST problem in graphs
- Single-sink network design with vertex connectivity requirements
- Survivable network design with degree or order constraints
Cited in
(6)- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
- Improved approximations for relative survivable network design
- Approximating fault-tolerant group-Steiner problems
- A simple approximation algorithm for minimum weight partial connected set cover
- On the hardness of full Steiner tree problems
- Survivable network design for group connectivity in low-treewidth graphs
This page was built for publication: Approximating fault-tolerant group-Steiner problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764316)
