A $\frac{3}{2}$-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts

Samuel Fiorini, Martin Groß, Jochen Könemann +1

The weighted tree augmentation problem (WTAP) is a fundamental network design problem. We are given an undirected tree $G=(V,E)$, an additional set of edges $L$ called links and…