A Better-Than-2 Approximation for Weighted Tree Augmentation
Abstract
We present an approximation algorithm for Weighted Tree Augmentation with approximation factor 1+ 2 + < 1.7. This is the first algorithm beating the longstanding factor of 2, which can be achieved through many standard techniques.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.