Pages that link to "Item:Q1003482"
From MaRDI portal
The following pages link to On the integrality ratio for tree augmentation (Q1003482):
Displaying 27 items.
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116) (← links)
- Covering a laminar family by leaf to leaf links (Q987693) (← 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)
- Approximation algorithms for vertex-connectivity augmentation on the cycle (Q2085731) (← links)
- Integer plane multiflow maximisation: one-quarter-approximation and gaps (Q2089777) (← 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)
- A simple LP-based approximation algorithm for the matching augmentation problem (Q2164677) (← 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)
- On the tree augmentation problem (Q2659770) (← links)
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs (Q2688462) (← links)
- Cut dominants and forbidden minors (Q2818204) (← links)
- A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius (Q3088090) (← links)
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs (Q4575906) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation (Q5041741) (← links)
- (Q5111750) (← links)
- An Improved Approximation Algorithm for the Matching Augmentation Problem (Q5883280) (← links)
- Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
- On a partition LP relaxation for min-cost 2-node connected spanning subgraphs (Q6106538) (← 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)
