Recommendations
- scientific article; zbMATH DE number 7053371
- scientific article; zbMATH DE number 2119644
- Set connectivity problems in undirected graphs and the directed Steiner network problem
- Set connectivity problems in undirected graphs and the directed Steiner network problem
- Inapproximability of survivable networks
Cited in
(12)- Improved approximation algorithms for minimum cost node-connectivity augmentation problems
- A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems
- Steiner problems with limited number of branching nodes
- Analysis of Steiner subtrees of random trees for traceroute algorithms
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
- scientific article; zbMATH DE number 7053371 (Why is no real title available?)
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- Improved approximations for relative survivable network design
- A new approach for approximating directed rooted networks
- Survivable network design with group-to-group requirement
This page was built for publication: Approximating rooted Steiner networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4962166)
