Beating approximation factor two for weighted tree augmentation with bounded costs
From MaRDI portal
Recommendations
Cited in
(22)- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
- Approximation algorithms for vertex-connectivity augmentation on the cycle
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
- Flexible graph connectivity
- A simple LP-based approximation algorithm for the matching augmentation problem
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
- scientific article; zbMATH DE number 6850362 (Why is no real title available?)
- Flexible Graph Connectivity
- Tight bounds for online weighted tree augmentation
- Improved approximation for tree augmentation: saving by rewiring
- An Improved Approximation Algorithm for the Matching Augmentation Problem
- Node connectivity augmentation via iterative randomized rounding
- 2-node-connectivity network design
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
- Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation
- Approximation algorithms for node and element connectivity augmentation problems
- A 4/3 approximation for 2-vertex-connectivity
- Better-than-2 approximations for weighted tree augmentation and applications to Steiner tree
- Survivable network design with group-to-group requirement
- Bridging the gap between tree and connectivity augmentation: unified and stronger approaches
- Approximation schemes for planar graph connectivity problems
- Tight bounds for online weighted tree augmentation
This page was built for publication: Beating approximation factor two for weighted tree augmentation with bounded costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629987)
