Pages that link to "Item:Q2429349"
From MaRDI portal
The following pages link to Approximating node-connectivity augmentation problems (Q2429349):
Displaying 17 items.
- Approximating source location and star survivable network problems (Q528470) (← links)
- Tight approximation algorithm for connectivity augmentation problems (Q931712) (← links)
- A note on the vertex-connectivity augmentation problem (Q1386437) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- Approximating subset \(k\)-connectivity problems (Q2376789) (← links)
- Approximating minimum cost source location problems with local vertex-connectivity demands (Q2434929) (← links)
- Approximating Source Location and Star Survivable Network Problems (Q2827812) (← links)
- Approximating connectivity augmentation problems (Q2921668) (← links)
- (Q3617662) (← links)
- (Q4228452) (← links)
- Minimum Cardinality Point-to-point Connectivity Augmentation Problem (Q4692118) (← links)
- Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (Q4939604) (← links)
- Approximation algorithms for graph augmentation (Q5204328) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
- On rooted node-connectivity problems (Q5945916) (← links)
- Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)