Pages that link to "Item:Q987693"
From MaRDI portal
The following pages link to Covering a laminar family by leaf to leaf links (Q987693):
Displaying 15 items.
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116) (← 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)
- Approximation algorithms for connectivity augmentation problems (Q2117100) (← links)
- 2-node-connectivity network design (Q2117701) (← 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)
- Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← links)
- LP-Relaxations for Tree Augmentation. (Q4636443) (← links)
- (Q5111750) (← links)
- 2-node-connectivity network design (Q6122594) (← 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)
- Improved first player strategy for the zero-sum sequential uncrossing game (Q6643644) (← links)