Pages that link to "Item:Q1709580"
From MaRDI portal
The following pages link to Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP (Q1709580):
Displaying 8 items.
- Approximation algorithms for vertex-connectivity augmentation on the cycle (Q2085731) (← links)
- On small-depth tree augmentations (Q2102832) (← links)
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem (Q2102838) (← links)
- A simple LP-based approximation algorithm for the matching augmentation problem (Q2164677) (← links)
- On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← 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)
