On rooted k-connectivity problems in quasi-bipartite digraphs
From MaRDI portal
Publication:2117101
Cites work
- scientific article; zbMATH DE number 3661345 (Why is no real title available?)
- scientific article; zbMATH DE number 1305468 (Why is no real title available?)
- scientific article; zbMATH DE number 6865614 (Why is no real title available?)
- scientific article; zbMATH DE number 7053371 (Why is no real title available?)
- A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- 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
- An \(O(\log^2{k})\)-approximation algorithm for the \(k\)-vertex connected spanning subgraph problem
- An improved approximation scheme for the Group Steiner Problem
- Approximating k-node Connected Subgraphs via Critical Graphs
- Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
- Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
- Approximating Steiner Networks with Node Weights
- Approximating source location and star survivable network problems
- Approximating the weight of shallow Steiner trees
- Approximation Algorithms for Directed Steiner Problems
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems
- Inapproximability of survivable networks
- Matroids and integrality gaps for hypergraphic Steiner tree relaxations
- Multi-rooted greedy approximation of directed Steiner trees with applications
- Parameters of two-prover-one-round game and the hardness of connectivity problems
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- Polylogarithmic inapproximability
- Prize-collecting survivable network design in node-weighted graphs
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems
- Rooted \(k\)-connections in digraphs
- Spider covers for prize-collecting network activation problem
- Steiner tree approximation via iterative randomized rounding
- Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree
- Tight approximation algorithm for connectivity augmentation problems
- \(O(\log^2 k/\log\log k)\)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm
This page was built for publication: On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117101)
