The following pages link to On the tree augmentation problem (Q2659770):
Displaying 8 items.
- Approximation algorithms for vertex-connectivity augmentation on the cycle (Q2085731) (← links)
- Approximation algorithms for connectivity augmentation problems (Q2117100) (← links)
- A simple LP-based approximation algorithm for the matching augmentation problem (Q2164677) (← links)
- An Improved Approximation Algorithm for the Matching Augmentation Problem (Q5883280) (← links)
- 2-node-connectivity network design (Q6122594) (← 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)
- Approximation algorithms for node and element connectivity augmentation problems (Q6635706) (← links)
