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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69f63b0a5d55b
DTSTART;TZID=America/Toronto:20240529T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240529T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-special-s
 eminar-vijay-vazirani
SUMMARY:C&O Special Seminar - Vijay Vazirani
CLASS:PUBLIC
DESCRIPTION:TITLE: A Theory of Alternating Paths and Blossoms\, from the\n
 Perspective of Minimum Length - Part 1\n\nSPEAKER:\n Vijay Vazirani\n\nAFF
 ILIATION:\n University of California\, Irvine\n\nLOCATION:\n MC 5479\n\nA
 BSTRACT: It is well known that the proof of some prominent results\nin ma
 thematics took a very long time --- decades and even centuries.\nThe first
  proof of the Micali-Vazirani (MV) algorithm\, for finding a\nmaximum card
 inality matching in general graphs\, was recently completed\n--- over four
  decades after the publication of the algorithm (1980).\nMV is still the m
 ost efficient known algorithm for the problem. In\ncontrast\, spectacular 
 progress in the field of combinatorial\noptimization has led to improved r
 unning times for most other\nfundamental problems in the last three decade
 s\, including bipartite\nmatching and max-flow.\n\nThe new ideas contained
  in the MV algorithm and its proof remain\nlargely unknown\, and hence une
 xplored\, for use elsewhere.\n\nThe purpose of this two-talk-sequence is t
 o rectify that shortcoming.
DTSTAMP:20260502T175730Z
END:VEVENT
END:VCALENDAR