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:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf5dfbdf477
DTSTART;TZID=America/Toronto:20240301T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240301T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-sanjeev-khanna
SUMMARY:Tutte Colloquium - Sanjeev Khanna
CLASS:PUBLIC
DESCRIPTION:TITLE: A Faster Combinatorial Algorithm for Maximum Bipartite\n
 Matching           \n\nSPEAKER:\n Sanjeev Khanna\n\nAFFILIATION:
 \n University of Pennsylvania\n\nLOCATION:\n MC 5501\n\nABSTRACT: The maxi
 mum bipartite matching problem is among the most\nfundamental and well-stu
 died problems in combinatorial optimization. A\nbeautiful and celebrated c
 ombinatorial algorithm of Hopcroft and Karp\n(1973) shows that maximum bip
 artite matching can be solved in $O(m\n\\sqrt{n})$ time on a graph with $n
 $ vertices and $m$ edges. For the\ncase of very dense graphs\, a fast matr
 ix multiplication based approach\ngives a running time of $O(n^{2.371})$. 
 These results represented the\nfastest known algorithms for the problem un
 til 2013\, when Madry\nintroduced a new approach based on continuous techn
 iques achieving\nmuch faster runtime in sparse graphs.
DTSTAMP:20260403T062811Z
END:VEVENT
END:VCALENDAR