A unified algorithm for degree bounded survivable network design
DOI10.1007/S10107-015-0858-5zbMATH Open1338.68292OpenAlexW2126340073MaRDI QIDQ896300FDOQ896300
Authors: Lap Chi Lau, Hong Zhou 
Publication date: 9 December 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0858-5
Recommendations
- A unified algorithm for degree bounded survivable network design
- Improved algorithm for degree bounded survivable network design problem
- Additive Approximation for Bounded Degree Survivable Network Design
- Degree bounded network design with metric costs
- Survivable network design with degree or order constraints
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Approximation algorithms (68W25)
Cites Work
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Degree Bounded Matroids and Submodular Flows
- On some network design problems with degree constraints
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Degree-Constrained Node-Connectivity
- Iterative Methods in Combinatorial Optimization
- 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
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- Network design via iterative rounding of setpair relaxations
- Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs
- On the L ∞ -Norm of Extreme Points for Crossing Supermodular Directed Network LPs
- Additive Approximation for Bounded Degree Survivable Network Design
Cited In (8)
- Improved algorithm for degree bounded survivable network design problem
- Approximating survivable networks with \(\beta \)-metric costs
- Survivable network design with degree or order constraints
- Approximation algorithms for degree-constrained minimum-cost network-design problems
- Additive Approximation for Bounded Degree Survivable Network Design
- A Spectral Approach to Network Design
- Designing survivable networks with zero-suppressed binary decision diagrams
- Complexity of column generation in network design with path-based survivability mechanisms
This page was built for publication: A unified algorithm for degree bounded survivable network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896300)
