Pages that link to "Item:Q2230719"
From MaRDI portal
The following pages link to On the cycle augmentation problem: hardness and approximation algorithms (Q2230719):
Displaying 5 items.
- Approximation algorithms for vertex-connectivity augmentation on the cycle (Q2085731) (← links)
- On the Cycle Augmentation Problem: hardness and approximation algorithms (Q2193089) (← links)
- Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond (Q6083603) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)
- Approximation algorithms for node and element connectivity augmentation problems (Q6635706) (← links)
