On Small-Depth Tree Augmentations
Data Structures and Algorithms
2021-11-02 v1
Abstract
We study the Weighted Tree Augmentation Problem for general link costs. We show that the integrality gap of the ODD-LP relaxation for the (weighted) Tree Augmentation Problem for a -level tree instance is at most . For 2- and 3-level trees, these ratios are and respectively. Our proofs are constructive and yield polynomial-time approximation algorithms with matching guarantees.
Cite
@article{arxiv.2111.00148,
title = {On Small-Depth Tree Augmentations},
author = {Ojas Parekh and R. Ravi and Michael Zlatin},
journal= {arXiv preprint arXiv:2111.00148},
year = {2021}
}