Pages that link to "Item:Q2376789"
From MaRDI portal
The following pages link to Approximating subset \(k\)-connectivity problems (Q2376789):
Displaying 10 items.
- Survivable network activation problems (Q386909) (← links)
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems (Q1799605) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- Approximating Survivable Networks with Minimum Number of Steiner Points (Q3075458) (← links)
- Spider Covering Algorithms for Network Design Problems (Q4689626) (← links)
- Approximating k-Connected m-Dominating Sets (Q5874545) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
