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:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d200a33c9f8
DTSTART;TZID=America/Toronto:20190308T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190308T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-akshay-ramachandran
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 54
 79 Waterloo ON N2L 3G1 Canada
SUMMARY:Combinatorial Optimization Reading Group- Akshay Ramachandran
CLASS:PUBLIC
DESCRIPTION:TITLE: On the Hardness of 4-coloring a 3-colorable graph\n\nSp
 eaker:\n Akshay Ramachandran\n\nAffiliation:\n University of Waterloo\n\nR
 oom:\n MC 5479\n\nABSTRACT: A consequence of the PCP theorem is that it is
  NP-hard to\napproximate the chromatic number of a general graph to within
 \n\\n^{1-\\eps} for any constant epsilon.
DTSTAMP:20260405T062643Z
END:VEVENT
END:VCALENDAR