Pages that link to "Item:Q2913818"
From MaRDI portal
The following pages link to An \(O(k^3\log n)\)-approximation algorithm for vertex-connectivity survivable network design (Q2913818):
Displaying 12 items.
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- 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 2-approximation algorithms for minimum-cost vertex connectivity problems (Q2496319) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- Single-sink network design with vertex connectivity requirements (Q3165953) (← links)
- (Q5009500) (← links)
- A note on iterated rounding for the survivable network design problem (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)
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing (Q6550988) (← links)