BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Sophie Huiberts (Columbia University in NYC)
DTSTART:20230504T141500Z
DTEND:20230504T160000Z
DTSTAMP:20260422T070229Z
UID:CJCS/115
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CJCS/115/">S
 moothed analysis of the simplex method</a>\nby Sophie Huiberts (Columbia U
 niversity in NYC) as part of Copenhagen-Jerusalem Combinatorics Seminar\n\
 n\nAbstract\nThe simplex method is a combinatorial algorithm for solving l
 inear optimization problems. The algorithm is very efficient in practice\,
  but theoretical explanations of this fact are lacking. In this talk\, I w
 ill describe one of the primary theoretical frameworks for analysing the s
 implex method\, smoothed analysis\, and present upper and lower bounds on 
 the algorithm's running time.\n
LOCATION:https://researchseminars.org/talk/CJCS/115/
END:VEVENT
END:VCALENDAR