Approximating subset k-connectivity problems
From MaRDI portal
Publication:2376789
Recommendations
- Approximating subset \(k\)-connectivity problems
- Improved approximation algorithms for min-cost connectivity augmentation problems
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems
- Approximating rooted connectivity augmentation problems
- Approximating rooted connectivity augmentation problems
Cites work
- scientific article; zbMATH DE number 7053371 (Why is no real title available?)
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
- A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
- An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
- An application of submodular flows
- An improved approximation algorithm for minimum-cost subset \(k\)-connectivity (extended abstract)
- Approximating k-node Connected Subgraphs via Critical Graphs
- Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
- Approximating node connectivity problems via set covers
- Approximating node-connectivity augmentation problems
- Approximating rooted connectivity augmentation problems
- Approximation Algorithms for Network Design with Metric Costs
- Augmenting undirected node-connectivity by one
- Hardness of Approximation for Vertex-Connectivity Network Design Problems
- Improved Approximation Algorithms for Uniform Connectivity Problems
- Inapproximability of survivable networks
- Minimal edge-coverings of pairs of sets
- On the optimal vertex-connectivity augmentation
- On the ratio of optimal integral and fractional covers
- Tight approximation algorithm for connectivity augmentation problems
Cited in
(22)- Approximating \(k\)-generalized connectivity via collapsing HSTs
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
- Multi-priority graph sparsification
- Approximating \(k\)-connected \(m\)-dominating sets
- Approximating rooted connectivity augmentation problems
- Approximating subset \(k\)-connectivity problems
- Improved approximation algorithms for min-cost connectivity augmentation problems
- Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
- Survivable network activation problems
- Spider covering algorithms for network design problems
- scientific article; zbMATH DE number 7720021 (Why is no real title available?)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- Approximating k-Connected m-Dominating Sets
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs
- Computing connected-\(k\)-subgraph cover with connectivity requirement
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems
- Approximating rooted connectivity augmentation problems
- Approximation Algorithms and Hardness Results for Labeled Connectivity Problems
- Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems
This page was built for publication: Approximating subset \(k\)-connectivity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376789)
