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:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d387e358f8a
DTSTART;TZID=America/Toronto:20190628T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190628T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-laura-sanita-1
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 55
 01 Waterloo ON N2L 3G1 Canada
SUMMARY:Tutte Colloquium - Laura Sanita
CLASS:PUBLIC
DESCRIPTION:TITLE: On the hardness of computing the diameter of a polytope
 \n\nSpeaker:\n Laura Sanita\n\nAffiliation:\n University of Waterloo\n\nRo
 om:\n MC 5501\n\nABSTRACT:\n\nThe diameter of a polytope P is given by the
  maximum length of a\nshortest path between a pair of vertices on P. Givin
 g bounds on the\ndiameter of a polytope is a fundamental research topic in
  theoretical\ncomputer science and discrete mathematics\, motivated by the
  (still\nunknown) existence of a polynomial pivot rule for the Simplex\nAl
 gorithm for solving Linear Programs.
DTSTAMP:20260406T101603Z
END:VEVENT
END:VCALENDAR