Pages that link to "Item:Q1709583"
From MaRDI portal
The following pages link to Approximating (unweighted) tree augmentation via lift-and-project. II (Q1709583):
Displaying 15 items.
- On the integrality ratio for tree augmentation (Q1003482) (← links)
- LP-relaxations for tree augmentation (Q1706120) (← links)
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP (Q1709580) (← links)
- Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← 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)
- On the tree augmentation problem (Q2659770) (← links)
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs (Q4575906) (← links)
- (Q4607935) (← links)
- (Q5111750) (← links)
- An Improved Approximation Algorithm for the Matching Augmentation Problem (Q5883280) (← 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)