Pages that link to "Item:Q5408765"
From MaRDI portal
The following pages link to Additive Approximation for Bounded Degree Survivable Network Design (Q5408765):
Displaying 8 items.
- A unified algorithm for degree bounded survivable network design (Q896300) (← links)
- Approximating bounded-degree spanning trees and connected factors with leaves (Q1728165) (← links)
- Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
- On approximating degree-bounded network design problems (Q2134742) (← links)
- The complexity of optimal design of temporally connected graphs (Q2408566) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- On approximating degree-bounded network design problems (Q6084395) (← links)