BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1424
DTSTAMP:20240801T044101Z
SUMMARY:Invitation to FPT Approximation via Cut and Coverage Problems
DESCRIPTION:Speaker: Saket Saurabh (The Institute of Mathematical Sciences)
 \n\nAbstract: \nIn this talk\, we will provide an introduction to the area
  of FPT-Approximation. The goal of this research area is to develop algori
 thms that are faster than known FPT algorithms and achieve better approxim
 ation factors than what is possible in polynomial time. We will explore re
 cent advances in this field through some classical cut and coverage proble
 ms\, such as k-Way Cut and Max-Coverage.\nShort Bio:\nSaket Saurabh receiv
 ed his PhD in Computer Science (2008)\, from The Institute of Mathe-matic
 al Sciences (IMSc)\, Chennai. Saurabh spent two years (2007-2009) as a Po
 stdoctoral Fellow at University of Bergen\, Norway\, and is now a profess
 or at IMSc.  He is a SwarnaJayanti Fellow in Mathematical Sciences (2018)
 \, Fellow of Indian Academy of Sciences (2020)\, Academia Europaea (2020)\
 , and European Association for Theoretical Computer Science (EATCS\, 2021
 ). He received the inaugural ACM India Early Career Researcher Award in 2
 020\, and Shanti Swarup Bhatnagar Prize (SSB) for Science and Technology 
 2021 (Mathematical Science).\n
URL:https://www.tcs.tifr.res.in/web/events/1424
DTSTART;TZID=Asia/Kolkata:20240806T160000
DTEND;TZID=Asia/Kolkata:20240806T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR