Clustering, Network Design and Linear Programming

Event details
Date | 18.07.2023 |
Hour | 15:30 › 17:30 |
Speaker | Lukas Vogl |
Location | |
Category | Conferences - Seminars |
Event Language | English |
EDIC candidacy exam
Exam president: Prof. Michael Kapralov
Thesis advisor: Prof. Ola Svensson
Thesis co-advisor: Prof. Friederich Eisenbrand
Co-examiner: Prof. Mika Göös
Abstract
Coming soon
Background papers
Vera Traub and Rico Zenklusen. "Local search for weighted tree augmentation and Steiner tree." SODA 2022: 3253-3272
András Sebő and Jens Vygen. "Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs." Comb. 34(5): 597-629 (2014)
Anna R. Karlin, Nathan Klein, and Shayan Oveis Gharan. "An improved approximation algorithm for TSP in the half integral case." STOC 2020: 28-39
Exam president: Prof. Michael Kapralov
Thesis advisor: Prof. Ola Svensson
Thesis co-advisor: Prof. Friederich Eisenbrand
Co-examiner: Prof. Mika Göös
Abstract
Coming soon
Background papers
Vera Traub and Rico Zenklusen. "Local search for weighted tree augmentation and Steiner tree." SODA 2022: 3253-3272
András Sebő and Jens Vygen. "Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs." Comb. 34(5): 597-629 (2014)
Anna R. Karlin, Nathan Klein, and Shayan Oveis Gharan. "An improved approximation algorithm for TSP in the half integral case." STOC 2020: 28-39
Practical information
- General public
- Free
Contact
- edic@epfl.ch