On the tree augmentation problem
From MaRDI portal
Publication:2659770
Recommendations
Cites work
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- 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. II
- Approximation Algorithms for Graph Augmentation
- Approximation Algorithms for Several Graph Augmentation 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
- Edmonds polytopes and a hierarchy of combinatorial problems
- Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
- 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 1833404 (Why is no real title available?)
- scientific article; zbMATH DE number 1405806 (Why is no real title available?)
- Improved approximation for tree augmentation: saving by rewiring
- Iterative methods in combinatorial optimization.
- LP-relaxations for tree augmentation
- On the integrality ratio for tree augmentation
- Optimization with binet matrices
- Outline of an algorithm for integer solutions to linear programs
- Parameterized algorithms
- Rational and integral \(k\)-regular matrices.
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
Cited in
(19)- On the integrality ratio for tree augmentation
- LP-relaxations for tree augmentation
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
- Approximation algorithms for vertex-connectivity augmentation on the cycle
- On small-depth tree augmentations
- Approximation algorithms for connectivity augmentation problems
- A simple LP-based approximation algorithm for the matching augmentation problem
- A (1 + 2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
- LP-relaxations for tree augmentation
- scientific article; zbMATH DE number 7205039 (Why is no real title available?)
- An Improved Approximation Algorithm for the Matching Augmentation Problem
- Mixed covering of trees and the augmentation problem with odd diameter constraints
- 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 mathematical programming approach for recognizing binet matrices
- Parameterized algorithms for node connectivity augmentation problems
- Approximation schemes for planar graph connectivity problems
This page was built for publication: On the tree augmentation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659770)
