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 k-level tree instance is at most 2 − 1 2 k−1 . For 2-and 3-level trees, these ratios are 3 2 and 7 4 respectively. Our proofs are constructive and yield polynomial-time approximation algorithms with matching guarantees.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.