Seminar: Vera Traub (ETH Zürich)
- https://wsc.project.cwi.nl/dutch-optimization-seminar/events/seminar-vera-traub-eth-zurich
- Seminar: Vera Traub (ETH Zürich)
- 2022-06-30T16:00:00+02:00
- 2022-06-30T17:00:00+02:00
- When Jun 30, 2022 from 04:00 PM to 05:00 PM (Europe/Amsterdam / UTC200)
- Where Online seminar
- Contact Name Daniel Dadush and Sven Polak
- Web Visit external website
-
Add event to calendar
iCal
Speaker: Vera Traub (ETH Zürich)
Title:
Better-Than-2 Approximations for Weighted Tree Augmentation and Forest Augmentation
Zoom link:
https://cwi-nl.zoom.us/j/84909645595?pwd=b1M4QnNKVzNMdmNSVFNaZUJmR1kvUT09
(Meeting ID: 849 0964 5595, Passcode: 772448)
Abstract:
The Weighted Tree Augmentation Problem (WTAP) is one of the most basic connectivity augmentation problems. It asks how to increase the edge-connectivity of a given graph from 1 to 2 in the cheapest possible way by adding some additional edges from a given set. In the first part of this talk we present the first algorithm that improves on the longstanding approximation ratio of 2 for WTAP.
In the second part of the talk we show how this algorithm can be used to obtain the first better-than-2 approximation algorithm for the Forest Augmentation Problem. In this problem we want to choose a minimum number of edges, among a given set of options, that we can add to a graph G to make it 2-edge connected. In contrast to the Tree Augmentation Problem, we do not require the given graph G to be connected.
This talk is based on joint works with Fabrizio Grandoni, Afrouz Jabal Ameli, and Rico Zenklusen.
In the second part of the talk we show how this algorithm can be used to obtain the first better-than-2 approximation algorithm for the Forest Augmentation Problem. In this problem we want to choose a minimum number of edges, among a given set of options, that we can add to a graph G to make it 2-edge connected. In contrast to the Tree Augmentation Problem, we do not require the given graph G to be connected.
This talk is based on joint works with Fabrizio Grandoni, Afrouz Jabal Ameli, and Rico Zenklusen.
Video:
Slides: