Metadata only
Date
2022Type
- Conference Paper
ETH Bibliography
yes
Altmetrics
Abstract
We present an approximation algorithm for Weighted Tree Augmentation with approximation factor 1 + ln 2+ epsilon < 1.7. This is the first algorithm beating the longstanding factor of 2, which can be achieved through many standard techniques.
Publication status
publishedExternal links
Book title
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)Pages / Article No.
Publisher
IEEEEvent
Subject
tree augmentation; connectivity augmentation; network design; approximation algorithmsOrganisational unit
09487 - Zenklusen, Rico / Zenklusen, Rico
More
Show all metadata
ETH Bibliography
yes
Altmetrics