Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
From MaRDI portal
Publication:2102838
DOI10.1016/j.orl.2022.10.007OpenAlexW4308178696MaRDI QIDQ2102838
Publication date: 12 December 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.05240
Related Items (2)
Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree ⋮ On small-depth tree augmentations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
- A factor 2 approximation algorithm for the generalized Steiner network problem
- On the integrality ratio for tree augmentation
- On the relationship between the biconnectivity augmentation and traveling salesman problems
- LP-relaxations for tree augmentation
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
- Approximating (unweighted) tree augmentation via lift-and-project. II
- Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes
- Shorter tours and longer detours: uniform covers and a bit beyond
- Improved low-degree testing and its applications
- Randomized metarounding (extended abstract)
- Approximation Algorithms for Several Graph Augmentation Problems
- Approximation Algorithms for Graph Augmentation
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
- A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2
- A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
This page was built for publication: Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
