Pages that link to "Item:Q931712"
From MaRDI portal
The following pages link to Tight approximation algorithm for connectivity augmentation problems (Q931712):
Displaying 14 items.
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- Augmenting edge-connectivity between vertex subsets (Q472470) (← links)
- Approximating source location and star survivable network problems (Q528470) (← links)
- A note on Rooted Survivable Networks (Q990935) (← links)
- Inapproximability of survivable networks (Q1019191) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
- Approximating subset \(k\)-connectivity problems (Q2376789) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- Approximating Source Location and Star Survivable Network Problems (Q2827812) (← links)
- Approximating connectivity augmentation problems (Q2921668) (← links)
- NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems (Q3125225) (← links)
- Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time (Q5470763) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q6200809) (← links)
