Pages that link to "Item:Q1706120"
From MaRDI portal
The following pages link to LP-relaxations for tree augmentation (Q1706120):
Displaying 10 items.
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP (Q1709580) (← links)
- Approximation algorithms for vertex-connectivity augmentation on the cycle (Q2085731) (← links)
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem (Q2102838) (← links)
- Flexible graph connectivity (Q2118137) (← links)
- A simple LP-based approximation algorithm for the matching augmentation problem (Q2164677) (← links)
- Flexible Graph Connectivity (Q5041731) (← links)
- (Q5111750) (← links)
- Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
- Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation (Q6608041) (← links)
- Improved first player strategy for the zero-sum sequential uncrossing game (Q6643644) (← links)
