The following pages link to (Q2913818):
Displaying 8 items.
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- A note on degree vs gap of Min-Rep label cover and improved inapproximability for connectivity problems (Q1730018) (← links)
- Approximability of capacitated network design (Q2354026) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- (Q5009500) (← links)
- (Q5240415) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
