We present an approximation algorithm for Weighted Tree Augmentation with approximation factor 1 + <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">ln 2+ε < 1.7</tex> . This is the first algorithm beating the longstanding factor of 2, which can be achieved through many standard techniques. −
No takes yet. Share an insight, caveat, or question.
Traub et al. (2022) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: