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:6827c4749ed71
DTSTART;TZID=America/Toronto:20240530T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240530T163000
URL:/combinatorics-and-optimization/events/co-special-s
 eminar-vijay-vazirani-0
SUMMARY:C&O Special Seminar - Vijay Vazirani
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: A Theory of Alternating Paths and Blossoms\
 , from the\nPerspective of Minimum Length - Part 2\n\nSPEAKER:\n Vijay Vaz
 irani\n\nAFFILIATION:\n University of California\, Irvine\n\nLOCATION:\n M
 C 5479\n\nABSTRACT: It is well known that the proof of some prominent res
 ults\nin mathematics took a very long time --- decades and even centuries.
 \nThe first proof of the Micali-Vazirani (MV) algorithm\, for finding a\nm
 aximum cardinality matching in general graphs\, was recently completed\n--
 - over four decades after the publication of the algorithm (1980).\nMV is 
 still the most efficient known algorithm for the problem. In\ncontrast\, s
 pectacular progress in the field of combinatorial\noptimization has led to
  improved running times for most other\nfundamental problems in the last t
 hree decades\, including bipartite\nmatching and max-flow.\n\nThe new idea
 s contained in the MV algorithm and its proof remain\nlargely unknown\, an
 d hence unexplored\, for use elsewhere.\n\nThe purpose of this two-talk-se
 quence is to rectify that shortcoming.\n 
DTSTAMP:20250516T230420Z
END:VEVENT
END:VCALENDAR