Approximating subset k-connectivity problems
From MaRDI portal
Approximating subset \(k\)-connectivity problems
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 node connectivity problems via set covers
- Approximating rooted connectivity augmentation problems
Cited in
(17)- Improved approximation algorithms for minimum cost node-connectivity augmentation problems
- Approximating \(k\)-connected \(m\)-dominating sets
- Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems
- A 4+ approximation for k-connected subgraphs
- Approximating subset \(k\)-connectivity problems
- Approximating rooted connectivity augmentation problems
- Approximating minimum-cost connectivity problems via uncrossable bifamilies
- Approximating minimum-cost edge-covers of crossing biset-families
- Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
- An almost O( k)-approximation for k-connected subgraphs
- Approximating \(k\)-generalized connectivity via collapsing HSTs
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
- Improved approximation algorithms for min-cost connectivity augmentation problems
- Approximation Algorithms and Hardness Results for Labeled Connectivity Problems
- Approximating rooted connectivity augmentation problems
- Computing connected-k-subgraph cover with connectivity requirement
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
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 Q2896372)
