Degree constrained node-connectivity problems
From MaRDI portal
Publication:486998
DOI10.1007/s00453-013-9849-1zbMath1314.68237OpenAlexW1983217642MaRDI QIDQ486998
Publication date: 19 January 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-013-9849-1
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)
Related Items (2)
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design ⋮ Complexity of some graph-based bounds on the probability of a union of events
Cites Work
- Unnamed Item
- Network design with weighted degree constraints
- Approximating directed weighted-degree constrained networks
- Network design via iterative rounding of setpair relaxations
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Rooted \(k\)-connections in digraphs
- An application of submodular flows
- Approximating node connectivity problems via set covers
- Minimal edge-coverings of pairs of sets
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Degree-Constrained Node-Connectivity
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design
- Iterative Methods in Combinatorial Optimization
- Network-Design with Degree Constraints
- Degree Bounded Network Design with Metric Costs
- Approximating minimum bounded degree spanning trees to within one of optimal
- Improved Algorithm for Degree Bounded Survivable Network Design Problem
- Survivable Network Design with Degree or Order Constraints
- Additive Guarantees for Degree-Bounded Directed Network Design
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
- Improved Approximation Algorithms for Uniform Connectivity Problems
- Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
- An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
This page was built for publication: Degree constrained node-connectivity problems
