Algorithms for Online and Stochastic Combinatorial Problems
Event details
| Date | 08.08.2023 |
| Hour | 15:00 › 17:00 |
| Speaker | Miltiadis Stouras |
| Location | |
| Category | Conferences - Seminars |
EDIC candidacy exam
Exam president: Prof. Michael Kapralov
Thesis advisor: Prof. Ola Svensson
Co-examiner: Prof. Mika Göös
Abstract
coming soon
Background papers
- k-servers with a Smile: Online Algorithms via Projections, Buchbinder, N., et al. SODA 2019
- Parsimonious Learning Augmented Caching, Im, S., et al., ICML 2022
- Stochastic Minimum Vertex Cover in General Graphs: A 3/2-Approximation, Derakhshan, M., et al., STOC 2023
Exam president: Prof. Michael Kapralov
Thesis advisor: Prof. Ola Svensson
Co-examiner: Prof. Mika Göös
Abstract
coming soon
Background papers
- k-servers with a Smile: Online Algorithms via Projections, Buchbinder, N., et al. SODA 2019
- Parsimonious Learning Augmented Caching, Im, S., et al., ICML 2022
- Stochastic Minimum Vertex Cover in General Graphs: A 3/2-Approximation, Derakhshan, M., et al., STOC 2023
Practical information
- General public
- Free