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 QIDQ2102838FDOQ2102838
Authors: Jennifer Iglesias, R. Ravi 
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
Recommendations
- Weighted coloring: further complexity and approximability results
- Theoretical Computer Science
- A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree
- Weighted coloring in trees
- Weighted coloring in trees
- Approximation Algorithms for Path Coloring in Trees
- On the Complexity of Some Colorful Problems Parameterized by Treewidth
- On the complexity of some colorful problems parameterized by treewidth
- Improved approximation algorithm for convex recoloring of trees
- Approximation and Online Algorithms
Cites Work
- 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
- On the relationship between the biconnectivity augmentation and traveling salesman problems
- A factor 2 approximation algorithm for the generalized Steiner network problem
- On the integrality ratio for tree augmentation
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
- Title not available (Why is that?)
- Improved low-degree testing and its applications
- Approximation Algorithms for Graph Augmentation
- Approximation Algorithms for Several Graph Augmentation Problems
- Randomized metarounding (extended abstract)
- LP-relaxations for tree augmentation
- Approximating (unweighted) tree augmentation via lift-and-project. II
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
- Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes
- Shorter tours and longer detours: uniform covers and a bit beyond
- Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
Cited In (2)
This page was built for publication: Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102838)
