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:69cf7aac3c5d4
DTSTART;TZID=America/Toronto:20240712T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240712T140000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-sina-kalantarzadeh
SUMMARY:C&O Reading Group - Sina Kalantarzadeh
CLASS:PUBLIC
DESCRIPTION:TITLE: Approximating Graphic TSP with matchings\n\nSPEAKER:\n 
 Sina Kalantarzadeh\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION:\n
  MC 6029\n\nABSTRACT: Revisiting defining character of the field of algor
 ithm\ndesign and complexity\, TSP!. While the problem itself is NP-Hard an
 d\ndifficult to approximate\, various formulations\, such as the Metric\nv
 ersion\, have yielded notable approximation algorithms. The classical\n1.5
 -approximation algorithm by Christofides\, leveraging matchings\,\nstood a
 s the best-known result for decades. However\, recent\nbreakthroughs have 
 pushed these boundaries further.
DTSTAMP:20260403T083036Z
END:VEVENT
END:VCALENDAR