BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Algorithms for Online and Stochastic Combinatorial Problems
DTSTART:20230808T150000
DTEND:20230808T170000
DTSTAMP:20260406T192913Z
UID:579104f516a5a9bb3e03d11846c952887a3e50d71b1bcbc7c8e71d34
CATEGORIES:Conferences - Seminars
DESCRIPTION:Miltiadis Stouras\nEDIC candidacy exam\nExam president: Prof. 
 Michael Kapralov\nThesis advisor: Prof. Ola Svensson\nCo-examiner: Prof. M
 ika Göös\n\nAbstract\ncoming soon\n\nBackground papers\n- k-servers wit
 h a Smile: Online Algorithms via Projections\, Buchbinder\, N.\, et al. SO
 DA 2019\n- Parsimonious Learning Augmented Caching\, Im\, S.\, et al.\, I
 CML 2022\n- Stochastic Minimum Vertex Cover in General Graphs: A 3/2-Appr
 oximation\, Derakhshan\, M.\, et al.\, STOC 2023\n 
LOCATION:BC 233 https://plan.epfl.ch/?room==BC%20233
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR