Approximating node connectivity problems via set covers
From MaRDI portal
Recommendations
Cited in
(44)- On k-connectivity problems with sharpened triangle inequality
- Approximating minimum-power edge-covers and 2,3-connectivity
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems
- Approximating bounded-degree spanning trees and connected factors with leaves
- Approximation algorithms for connected graph factors of minimum weight
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems
- Fast distributed approximation for TAP and 2-edge-connectivity
- A 4+ approximation for k-connected subgraphs
- Approximating subset \(k\)-connectivity problems
- Approximating node-connectivity augmentation problems
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- scientific article; zbMATH DE number 1670542 (Why is no real title available?)
- Approximation algorithms for minimum-cost k-(S,T) connected digraphs
- Approximating subset k-connectivity problems
- Approximating minimum-cost connectivity problems via uncrossable bifamilies
- Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
- A (1 + 2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
- On directed Steiner trees with multiple roots
- Set connectivity problems in undirected graphs and the directed Steiner network problem
- Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs
- Approximation Algorithms for Network Design with Metric Costs
- Approximation algorithm for k-node connected subgraphs via critical graphs
- Survivable network activation problems
- scientific article; zbMATH DE number 1305534 (Why is no real title available?)
- scientific article; zbMATH DE number 2080258 (Why is no real title available?)
- Complexity and approximation of the connected set-cover problem
- An almost O( k)-approximation for k-connected subgraphs
- Degree constrained node-connectivity problems
- Connected Set Cover Problem and Its Applications
- Approximating survivable networks with \(\beta \)-metric costs
- Approximating k-node Connected Subgraphs via Critical Graphs
- Improved approximation algorithms for min-cost connectivity augmentation problems
- Approximating k-Connected m-Dominating Sets
- On rooted node-connectivity problems
- On a partition LP relaxation for min-cost 2-node connected spanning subgraphs
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- Relay placement for fault tolerance in wireless networks in higher dimensions
- A note on `Algorithms for connected set cover problem and fault-tolerant connected set cover problem'
- Parameterized algorithms for node connectivity augmentation problems
- A logarithmic approximation algorithm for the activation edge-multicover problem
- Bicriteria approximation for k-edge-connectivity
- Power optimization for connectivity problems
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
- On minimum power connectivity problems
This page was built for publication: Approximating node connectivity problems via set covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1424250)
