Better-than-43-approximations for leaf-to-leaf tree and connectivity augmentation
From MaRDI portal
Publication:6608041
Recommendations
- Covering a laminar family by leaf to leaf links
- Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree
- Improved approximation for tree augmentation: saving by rewiring
- LP-relaxations for tree augmentation
Cites work
- scientific article; zbMATH DE number 1003253 (Why is no real title available?)
- scientific article; zbMATH DE number 6850362 (Why is no real title available?)
- scientific article; zbMATH DE number 1405806 (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
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree
- 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
- Approximation algorithms for connectivity augmentation problems
- Beating approximation factor two for weighted tree augmentation with bounded costs
- Covering a laminar family by leaf to leaf links
- Geometric algorithms and combinatorial optimization.
- Hardness of Approximation for Vertex-Connectivity Network Design Problems
- Improved approximation for tree augmentation: saving by rewiring
- LP-relaxations for tree augmentation
- On the integrality ratio for tree augmentation
- On the tree augmentation problem
- Parameterized algorithms to preserve connectivity
- Rooted \(k\)-connections in digraphs
Cited in
(2)
This page was built for publication: Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608041)
