The following pages link to (Q5111750):
Displaying 13 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)
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem (Q2102838) (← links)
- 2-node-connectivity network design (Q2117701) (← links)
- A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
- Flexible graph connectivity (Q2118137) (← links)
- On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
- On the tree augmentation problem (Q2659770) (← links)
- Flexible Graph Connectivity (Q5041731) (← links)
- A Technique for Obtaining True Approximations for k-Center with Covering Constraints (Q5041734) (← links)
- Mixed covering of trees and the augmentation problem with odd diameter constraints (Q5920611) (← links)
- Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
