scientific article; zbMATH DE number 7205039
From MaRDI portal
Publication:5111750
Recommendations
- On the tree augmentation problem
- Almost optimal algorithms for diameter-optimally augmenting trees
- Almost optimal algorithms for diameter-optimally augmenting trees
- Algorithms for radius-optimally augmenting trees in a metric space
- Algorithms for radius-optimally augmenting trees in a metric space
- A tight bound for shortest augmenting paths on trees
- Augmenting trees to meet biconnectivity and diameter constraints
- LP-relaxations for tree augmentation
- LP-relaxations for tree augmentation
Cites work
- scientific article; zbMATH DE number 1003253 (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?)
- A \(1.5\)-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
- 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
- Covering a laminar family by leaf to leaf links
- Fixed-parameter algorithms for minimum cost edge-connectivity augmentation
- Iterative methods in combinatorial optimization.
- LP-relaxations for tree augmentation
- On the integrality ratio for tree augmentation
- Parameterized algorithms
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
Cited in
(17)- On small-depth tree augmentations
- Mixed covering of trees and the augmentation problem with odd diameter constraints
- Flexible Graph Connectivity
- A technique for obtaining true approximations for \(k\)-center with covering constraints
- Flexible graph connectivity
- A technique for obtaining true approximations for \(k\)-center with covering constraints
- A \((1.5+\varepsilon)\)-approximation algorithm for weighted connectivity augmentation
- On the tree augmentation problem
- On the cycle augmentation problem: hardness and approximation algorithms
- 2-node-connectivity network design
- Node connectivity augmentation via iterative randomized rounding
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP
- Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem
- A \((1 + \ln 2)\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
- On the integrality ratio for tree augmentation
- LP-relaxations for tree augmentation
- A simple LP-based approximation algorithm for the matching augmentation problem
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 Q5111750)
