Approximation algorithms for Steiner Tree Augmentation Problems

R. Ravi, Weizhong Zhang, Michael Zlatin

In the Steiner Tree Augmentation Problem (STAP), we are given a graph $G=(V,E)$, a set of terminals $R\subseteq V$, and a Steiner tree $T$ spanning $R$. The edges $L := E \setmi…