The following pages link to (Q4938792):
Displayed 24 items.
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116) (← links)
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- Generalized laminar families and certain forbidden matrices (Q890016) (← links)
- Covering a laminar family by leaf to leaf links (Q987693) (← links)
- 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)
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree (Q1861569) (← links)
- Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes (Q2067494) (← 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)
- 2-node-connectivity network design (Q2117701) (← links)
- Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
- On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
- An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph (Q2656340) (← links)
- On the tree augmentation problem (Q2659770) (← links)
- A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius (Q3088090) (← links)
- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees (Q3602825) (← links)
- (Q5111750) (← links)
- Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
- Maximum flows in parametric graph templates (Q6057318) (← links)
- 2-node-connectivity network design (Q6122594) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)