On the Tree Augmentation Problem
Author:
- 15 September 2020
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 83 (2) , 553-575
Abstract
No abstract availableKeywords
All Related Versions
This publication has 23 references indexed in Scilit:
- A-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radiusTheoretical Computer Science, 2013
- Covering a laminar family by leaf to leaf linksDiscrete Applied Mathematics, 2010
- A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2ACM Transactions on Algorithms, 2009
- On the integrality ratio for tree augmentationOperations Research Letters, 2008
- Optimization with binet matricesOperations Research Letters, 2007
- Rational and integral k-regular matricesDiscrete Mathematics, 2004
- An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning treeDiscrete Applied Mathematics, 2003
- Approximation Algorithms for Graph AugmentationJournal of Algorithms, 1993
- Approximation Algorithms for Several Graph Augmentation ProblemsSIAM Journal on Computing, 1981
- Outline of an algorithm for integer solutions to linear programsBulletin of the American Mathematical Society, 1958