English

A Better-Than-2 Approximation for Weighted Tree Augmentation

Data Structures and Algorithms 2021-04-16 v1 Optimization and Control

Abstract

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

Keywords

Cite

@article{arxiv.2104.07114,
  title  = {A Better-Than-2 Approximation for Weighted Tree Augmentation},
  author = {Vera Traub and Rico Zenklusen},
  journal= {arXiv preprint arXiv:2104.07114},
  year   = {2021}
}
R2 v1 2026-06-24T01:10:47.236Z