Local search for weighted tree augmentation and steiner tree

V Traub, R Zenklusen - Proceedings of the 2022 Annual ACM-SIAM …, 2022 - SIAM
We present a technique that allows for improving on some relative greedy procedures by
well-chosen (non-oblivious) local search algorithms. Relative greedy procedures are a …

A better-than-2 approximation for weighted tree augmentation

V Traub, R Zenklusen - 2021 IEEE 62nd Annual Symposium on …, 2022 - ieeexplore.ieee.org
A Better-Than-2 Approximation for Weighted Tree Augmentation Page 1 A Better-Than-2
Approximation for Weighted Tree Augmentation Vera Traub Department of Mathematics ETH …

Bridging the gap between tree and connectivity augmentation: unified and stronger approaches

F Cecchetto, V Traub, R Zenklusen - … of the 53rd Annual ACM SIGACT …, 2021 - dl.acm.org
We consider the Connectivity Augmentation Problem (CAP), a classical problem in the area
of Survivable Network Design. It is about increasing the edge-connectivity of a graph by one …

A (1.5+ ε)-approximation algorithm for weighted connectivity augmentation

V Traub, R Zenklusen - Proceedings of the 55th Annual ACM …, 2023 - dl.acm.org
Connectivity augmentation problems are among the most elementary questions in Network
Design. Many of these problems admit natural 2-approximation algorithms, often through …

Approximating weighted tree augmentation via Chvátal-Gomory cuts

S Fiorini, M Groß, J Könemann, L Sanità - … of the Twenty-Ninth Annual ACM …, 2018 - SIAM
The weighted tree augmentation problem (WTAP) is a fundamental network design problem.
We are given an undirected tree G=(V, E) with n=| V| nodes, an additional set of edges L …

Improved approximation for tree augmentation: saving by rewiring

F Grandoni, C Kalaitzis, R Zenklusen - … of the 50th Annual ACM SIGACT …, 2018 - dl.acm.org
The Tree Augmentation Problem (TAP) is a fundamental network design problem in which
we are given a tree and a set of additional edges, also called links. The task is to find a set of …

Beating approximation factor two for weighted tree augmentation with bounded costs

D Adjiashvili - ACM Transactions on Algorithms (TALG), 2018 - dl.acm.org
The Weighted Tree Augmentation Problem (WTAP) is a fundamental well-studied problem in
the field of network design. Given an undirected tree G=(V, E), an additional set of edges L⊑ …

Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree

J Byrka, F Grandoni, AJ Ameli - Proceedings of the 52nd Annual ACM …, 2020 - dl.acm.org
The basic goal of survivable network design is to build a cheap network that maintains the
connectivity between given sets of nodes despite the failure of a few edges/nodes. The …

A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2

G Kortsarz, Z Nutov - ACM Transactions on Algorithms (TALG), 2015 - dl.acm.org
The Tree Augmentation Problem (TAP) is as follows: given a connected graph G=(V, ε) and
an edge set E on V, find a minimum size subset of edges F⊆ E such that (V, ε∪ F) is 2-edge …

Improved approximation for two-edge-connectivity

M Garg, F Grandoni, A Jabal Ameli - Proceedings of the 2023 Annual ACM …, 2023 - SIAM
The basic goal of survivable network design is to construct low-cost networks which
preserve a sufficient level of connectivity despite the failure or removal of a few nodes or …