Degree constrained node-connectivity problems
From MaRDI portal
Recommendations
- Degree-constrained node-connectivity
- Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
- Survivable network design with degree or order constraints
- Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements
- Network-design with degree constraints
Cites work
- scientific article; zbMATH DE number 5485590 (Why is no real title available?)
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Additive guarantees for degree-bounded directed network design
- An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
- An application of submodular flows
- Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
- Approximating directed weighted-degree constrained networks
- Approximating minimum bounded degree spanning trees to within one of optimal
- Approximating node connectivity problems via set covers
- Degree bounded network design with metric costs
- Degree-constrained node-connectivity
- Improved Approximation Algorithms for Uniform Connectivity Problems
- Improved algorithm for degree bounded survivable network design problem
- Iterative methods in combinatorial optimization.
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
- Minimal edge-coverings of pairs of sets
- Network design via iterative rounding of setpair relaxations
- Network design with weighted degree constraints
- Network-design with degree constraints
- Rooted \(k\)-connections in digraphs
- Survivable network design with degree or order constraints
Cited in
(11)- On the approximability of some degree-constrained subgraph problems
- Approximating directed weighted-degree constrained networks
- Approximating Directed Weighted-Degree Constrained Networks
- Improved algorithm for degree bounded survivable network design problem
- Network Design with Edge-Connectivity and Degree Constraints
- Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
- Network-design with degree constraints
- The connected critical node problem
- On some network design problems with degree constraints
- Degree-constrained node-connectivity
- Complexity of some graph-based bounds on the probability of a union of events
This page was built for publication: Degree constrained node-connectivity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486998)
