Additive Approximation for Bounded Degree Survivable Network Design
From MaRDI portal
Recommendations
- Additive guarantees for degree-bounded directed network design
- A unified algorithm for degree bounded survivable network design
- A unified algorithm for degree bounded survivable network design
- scientific article; zbMATH DE number 1263260
- An efficient approximation algorithm for the survivable network design problem
- Improved algorithm for degree bounded survivable network design problem
- Strong lower bounds for a survivable network design problem
- Survivable network design problems with weighted degree constraints
- Survivable network design with degree or order constraints
- Approximability of robust network design
Cited in
(15)- Approximating bounded-degree spanning trees and connected factors with leaves
- Approximation algorithms for connected graph factors of minimum weight
- On approximating degree-bounded network design problems
- The complexity of optimal design of temporally connected graphs
- Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
- 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 Spectral Approach to Network Design
- Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements
- A unified algorithm for degree bounded survivable network design
- On approximating degree-bounded network design problems
- Fast combinatorial algorithms for efficient sortation
- Fast combinatorial algorithms for efficient sortation
- A unified algorithm for degree bounded survivable network design
This page was built for publication: Additive Approximation for Bounded Degree Survivable Network Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408765)
