LP-relaxations for tree augmentation
From MaRDI portal
Recommendations
- LP-relaxations for tree augmentation
- On the tree augmentation problem
- scientific article; zbMATH DE number 7205039
- Improved approximation for tree augmentation: saving by rewiring
- On the integrality ratio for tree augmentation
- On small-depth tree augmentations
- LP relaxation and tree packing for minimum \(k\)-cut
- Approximating (unweighted) tree augmentation via lift-and-project. II
- Algorithms for radius-optimally augmenting trees in a metric space
- Algorithms for radius-optimally augmenting trees in a metric space
Cites work
- scientific article; zbMATH DE number 6850362 (Why is no real title available?)
- scientific article; zbMATH DE number 1833404 (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 primal-dual approximation algorithm for generalized Steiner network problems
- 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. II
- Approximation Algorithms for Graph Augmentation
- Approximation Algorithms for Several Graph Augmentation Problems
- Approximation algorithms for NP-hard problems.
- Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Covering a laminar family by leaf to leaf links
- Iterative methods in combinatorial optimization.
- On the integrality ratio for tree augmentation
- On the relationship between the biconnectivity augmentation and traveling salesman problems
- Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
Cited in
(19)- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
- On the integrality ratio for tree augmentation
- On the tree augmentation problem
- Approximation algorithms for vertex-connectivity augmentation on the cycle
- Flexible graph connectivity
- Node connectivity augmentation via iterative randomized rounding
- A \((1 + \ln 2)\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
- Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation
- scientific article; zbMATH DE number 7205039 (Why is no real title available?)
- A simple LP-based approximation algorithm for the matching augmentation problem
- Improved first player strategy for the zero-sum sequential uncrossing game
- Matching Based Augmentations for Approximating Connectivity Problems
- Flexible Graph Connectivity
- A \((1.5+\varepsilon)\)-approximation algorithm for weighted connectivity augmentation
- Approximating (unweighted) tree augmentation via lift-and-project. II
- LP-relaxations for tree augmentation
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
- Improved approximation for tree augmentation: saving by rewiring
- On small-depth tree augmentations
This page was built for publication: LP-relaxations for tree augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1706120)
