scientific article; zbMATH DE number 6850362
From MaRDI portal
Publication:4607935
Recommendations
- Beating approximation factor two for weighted tree augmentation with bounded costs
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
- Approximating Generalized Multicut on Trees
- On weighted multiway cuts in trees
- Tight bounds for online weighted tree augmentation
- Tight bounds for online weighted tree augmentation
- Improved approximation for tree augmentation: saving by rewiring
- Approximating (unweighted) tree augmentation via lift-and-project. II
- Parameterized complexity of weighted multicut in trees
- Parameterized complexity of multicut in weighted trees
Cited in
(31)- Beating approximation factor two for weighted tree augmentation with bounded costs
- Fast distributed approximation for TAP and 2-edge-connectivity
- How to Secure Matchings Against Edge Failures
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
- Tight bounds for online weighted tree augmentation
- Tight bounds for online weighted tree augmentation
- On the tree augmentation problem
- Approximation algorithms for vertex-connectivity augmentation on the cycle
- Flexible graph connectivity
- The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm
- Chvátal-Gomory cuts for the Steiner tree problem
- 2-node-connectivity network design
- Node connectivity augmentation via iterative randomized rounding
- An Improved Approximation Algorithm for the Matching Augmentation Problem
- Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
- Approximation algorithms for connectivity augmentation problems
- Approximation algorithms for node and element connectivity augmentation problems
- A simple LP-based approximation algorithm for the matching augmentation problem
- Strengthening convex relaxations of 0/1-sets using Boolean formulas
- Flexible Graph Connectivity
- A \((1.5+\varepsilon)\)-approximation algorithm for weighted connectivity augmentation
- LP-relaxations for tree augmentation
- Approximating (unweighted) tree augmentation via lift-and-project. II
- LP-relaxations for tree augmentation
- 2-node-connectivity network design
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
- On the cycle augmentation problem: hardness and approximation algorithms
- Improved approximation for tree augmentation: saving by rewiring
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
- On small-depth tree augmentations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607935)
