Pages that link to "Item:Q2949211"
From MaRDI portal
The following pages link to Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211):
Displaying 6 items.
- Degree constrained node-connectivity problems (Q486998) (← links)
- Approximating minimum power edge-multi-covers (Q498430) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
