Pages that link to "Item:Q2921668"
From MaRDI portal
The following pages link to Approximating connectivity augmentation problems (Q2921668):
Displaying 22 items.
- On algebraic connectivity augmentation (Q550607) (← links)
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs (Q848841) (← links)
- Tight approximation algorithm for connectivity augmentation problems (Q931712) (← links)
- Local edge-connectivity augmentation in hypergraphs is NP-complete (Q968204) (← links)
- A note on Rooted Survivable Networks (Q990935) (← links)
- Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs (Q1013291) (← links)
- Inapproximability of survivable networks (Q1019191) (← links)
- A note on the vertex-connectivity augmentation problem (Q1386437) (← links)
- On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- A unifying approach to splitting-off (Q2448935) (← links)
- Approximating rooted connectivity augmentation problems (Q2492636) (← links)
- Edge-Connectivity Augmentations of Graphs and Hypergraphs (Q2971622) (← links)
- (Q4537741) (← links)
- Approximating Minimum Cost Connectivity Orientation and Augmentation (Q4606698) (← links)
- Minimum Cardinality Point-to-point Connectivity Augmentation Problem (Q4692118) (← links)
- Primal-dual approach for directed vertex connectivity augmentation and generalizations (Q4962713) (← links)
- Approximating Steiner Networks with Node Weights (Q5458547) (← links)
- Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time (Q5470763) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900929) (← 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)