BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:682d6b605c9f7
DTSTART;TZID=America/Toronto:20230823T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230823T113000
URL:/combinatorics-and-optimization/events/co-reading-g
 roup-niv-buchbinder
SUMMARY:C&O Reading Group - Niv Buchbinder
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Chasing Positive Bodies\n\nSPEAKER:\n Niv Bu
 chbinder\n\nAFFILIATION:\n Tel Aviv University\n\nLOCATION:\n MC 5417\n\nA
 BSTRACT: We study the problem of chasing positive bodies in \\ell_1:\ngive
 n a sequence of bodies K_t\\subset R^n revealed online\, where each\nK_t i
 s defined by a mixed packing-covering linear program\, the goal is\nto (ap
 proximately) maintain a point x_t \\in K_t such that \\sum_t \\|x_t\n- x_{
 t-1}\\|_1 is minimized. This captures the fully-dynamic\nlow-recourse vari
 ant of any problem that can be expressed as a mixed\npacking-covering line
 ar program and thus also the fractional version\nof many central problems 
 in dynamic algorithms such as set cover\, load\nbalancing\, hyperedge orie
 ntation\, minimum spanning tree\, and matching.\n 
DTSTAMP:20250521T055752Z
END:VEVENT
END:VCALENDAR