Pages that link to "Item:Q1941534"
From MaRDI portal
The following pages link to A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs (Q1941534):
Displaying 5 items.
- Approximating minimum-cost edge-covers of crossing biset-families (Q397064) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
