Pages that link to "Item:Q2117100"
From MaRDI portal
The following pages link to Approximation algorithms for connectivity augmentation problems (Q2117100):
Displaying 16 items.
- On algebraic connectivity augmentation (Q550607) (← links)
- Dual-based approximation algorithms for cut-based network connectivity problems (Q722530) (← links)
- A note on the vertex-connectivity augmentation problem (Q1386437) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- Approximating connectivity augmentation problems (Q2921668) (← links)
- NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems (Q3125225) (← links)
- Approximating Minimum Cost Connectivity Orientation and Augmentation (Q4606698) (← links)
- Minimum Cardinality Point-to-point Connectivity Augmentation Problem (Q4692118) (← links)
- Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (Q4939604) (← links)
- Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation (Q4962187) (← links)
- Approximation algorithms for graph augmentation (Q5204328) (← links)
- Optimal Augmentation for Bipartite Componentwise Biconnectivity in Linear Time (Q5470763) (← links)
- Approximation Algorithms and Hardness Results for Labeled Connectivity Problems (Q5756701) (← 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)
- Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation (Q6608041) (← links)