BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Assaf Naor (Prof.)
DTSTART:20260304T160000Z
DTEND:20260304T170000Z
DTSTAMP:20260423T004513Z
UID:th21/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/th21/3/">Spa
 rsest cut</a>\nby Assaf Naor (Prof.) as part of Theorems of the 21st Centu
 ry Seminar\n\nLecture held in Online only.\n\nAbstract\nProf. Assaf Naor i
 s a world-leading mathematician known for his groundbreaking contributions
  at the interface of metric geometry\, analysis\, and approximation algori
 thms. His work has earned numerous major distinctions\, including the Nemm
 ers Prize in Mathematics\, the Ostrowski Prize\, and the Bôcher Memorial 
 Prize. In this talk\, he will discuss the Sparsest Cut problem\, explain i
 ts significance in algorithm design\, and present recent algorithm for its
  efficient approximation\, which is a culmination of decades of work.\n
LOCATION:https://researchseminars.org/talk/th21/3/
END:VEVENT
END:VCALENDAR