Pages that link to "Item:Q494800"
From MaRDI portal
The following pages link to An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800):
Displayed 6 items.
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems (Q1799605) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity (Q3012788) (← links)
- (Q5009500) (← links)
- Approximating k-Connected m-Dominating Sets (Q5874545) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)