The following pages link to (Q4607935):
Displaying 28 items.
- Tight bounds for online weighted tree augmentation (Q832514) (← links)
- LP-relaxations for tree augmentation (Q1706120) (← links)
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP (Q1709580) (← links)
- Approximating (unweighted) tree augmentation via lift-and-project. II (Q1709583) (← links)
- Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← links)
- 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)
- Approximation algorithms for connectivity augmentation problems (Q2117100) (← links)
- 2-node-connectivity network design (Q2117701) (← links)
- Flexible graph connectivity (Q2118137) (← links)
- A simple LP-based approximation algorithm for the matching augmentation problem (Q2164677) (← links)
- The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772) (← links)
- On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
- On the tree augmentation problem (Q2659770) (← links)
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs (Q4575906) (← links)
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs (Q4629987) (← links)
- LP-Relaxations for Tree Augmentation. (Q4636443) (← links)
- Flexible Graph Connectivity (Q5041731) (← links)
- How to Secure Matchings Against Edge Failures (Q5090488) (← links)
- An Improved Approximation Algorithm for the Matching Augmentation Problem (Q5883280) (← links)
- Node connectivity augmentation via iterative randomized rounding (Q6038664) (← 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)
