Pages that link to "Item:Q2929700"
From MaRDI portal
The following pages link to Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs (Q2929700):
Displaying 11 items.
- Approximating minimum power edge-multi-covers (Q498430) (← links)
- A unified algorithm for degree bounded survivable network design (Q896300) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- On the fixed-parameter tractability of the maximum connectivity improvement problem (Q2195571) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
- (Q5874542) (← links)
- Approximating k-Connected m-Dominating Sets (Q5874545) (← links)
- Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)