Connectivity Problems in Graphs
Event details
| Date | 14.02.2022 |
| Hour | 10:00 › 12:00 |
| Speaker | Marina Drygala |
| Category | Conferences - Seminars |
EDIC candidacy exam
Exam president: Prof. Mika Göös
Thesis advisor: Prof. Ola Svensson
Co-examiner: Prof. Michael Kapralov
Abstract
comming soon
Background papers
An Improved Approximation Algorithm for TSP in the Half Integral Case, by Karlin A. et al.
A Better-Than-2 Approximation for Weighted Tree Augmentation, by Vera Traub, Rico Zenklusen
Approximating the minimum equivalent digraph, by Khuller, S., et al.
Exam president: Prof. Mika Göös
Thesis advisor: Prof. Ola Svensson
Co-examiner: Prof. Michael Kapralov
Abstract
comming soon
Background papers
An Improved Approximation Algorithm for TSP in the Half Integral Case, by Karlin A. et al.
A Better-Than-2 Approximation for Weighted Tree Augmentation, by Vera Traub, Rico Zenklusen
Approximating the minimum equivalent digraph, by Khuller, S., et al.
Practical information
- General public
- Free