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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6837990a1f530
DTSTART;TZID=America/Toronto:20220323T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220323T130000
URL:/computer-science/events/seminar-algorithms-and-com
 plexity-almost-linear-time-algorithms-for-max-flow-and-more
SUMMARY:Seminar • Algorithms and Complexity • Almost Linear Time\nAlgor
 ithms for Max-flow and More
CLASS:PUBLIC
DESCRIPTION:Summary \n\nPLEASE NOTE: THIS SEMINAR WILL BE GIVEN ONLINE.\n\n
 SUSHANT SACHDEVA\, ASSISTANT PROFESSOR\n_Department of Computer Science\, 
 University of Toronto_\n\nWe give the first almost-linear time algorithm f
 or computing exact\nmaximum flows and minimum-cost flows on directed graph
 s. By well known\nreductions\, this implies almost-linear time algorithms 
 for several\nproblems including bipartite matching\, optimal transport\, a
 nd\nundirected vertex connectivity.\n 
DTSTAMP:20250528T231522Z
END:VEVENT
END:VCALENDAR