Approximating minimum-cost connectivity problems via uncrossable bifamilies
From MaRDI portal
Recommendations
Cited in
(30)- Approximating node connectivity problems via set covers
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems
- Approximation algorithm for the partial set multi-cover problem
- Approximating \(k\)-connected \(m\)-dominating sets
- A 4+ approximation for k-connected subgraphs
- scientific article; zbMATH DE number 1670542 (Why is no real title available?)
- Approximating source location and star survivable network problems
- Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
- On fixed cost \(k\)-flow problems
- Approximating minimum-cost edge-covers of crossing biset-families
- Erratum: ``Approximating minimum-cost connectivity problems via uncrossable bifamilies
- An almost O( k)-approximation for k-connected subgraphs
- Spider covering algorithms for network design problems
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
- Survivable network design for group connectivity in low-treewidth graphs
- Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
- Approximating source location and star survivable network problems
- On survivable set connectivity
- Improved approximation algorithms for min-cost connectivity augmentation problems
- Approximating k-Connected m-Dominating Sets
- Fast exact algorithms for survivable network design with uniform requirements
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- The parameterized complexity of the survivable network design problem
- Parameterized algorithms for node connectivity augmentation problems
- Bicriteria approximation for k-edge-connectivity
- Streaming algorithms for network design
This page was built for publication: Approximating minimum-cost connectivity problems via uncrossable bifamilies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933629)
