Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
From MaRDI portal
Publication:2102838
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
- scientific article; zbMATH DE number 6850362 (Why is no real title available?)
- scientific article; zbMATH DE number 1405806 (Why is no real title available?)
- scientific article; zbMATH DE number 7205039 (Why is no real title available?)
- A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- 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
- A simplified \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
- Approximating (unweighted) tree augmentation via lift-and-project. II
- Approximation Algorithms for Graph Augmentation
- Approximation Algorithms for Several Graph Augmentation Problems
- Beating approximation factor two for weighted tree augmentation with bounded costs
- Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
- Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes
- Improved low-degree testing and its applications
- LP-relaxations for tree augmentation
- On the integrality ratio for tree augmentation
- On the relationship between the biconnectivity augmentation and traveling salesman problems
- Randomized metarounding (extended abstract)
- Shorter tours and longer detours: uniform covers and a bit beyond
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)
