We present an approximation algorithm for Weighted Tree Augmentation with approximation factor $1+\ln 2 + \varepsilon < 1.7$. This is the first algorithm beating the longstanding factor of $2$, which can be achieved through many standard techniques.

翻译：我们提出了一个加权树增殖的近似算法,其近似系数为$1 ⁇ 00 2 + \ varepsilon < 1.7美元。这是第一个超过长期因素$2的算法,可以通过许多标准技术实现。