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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20261101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6af77eeb43b98
DTSTART;TZID=America/Toronto:20261116T110000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261116T120000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combopt-read
 ing-group-mehrdad-sohrabi-approximating-graphic
SUMMARY:CombOpt Reading Group | Mehrdad Sohrabi\, Approximating graphic TSP
  by\nb-matchings
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n\nMehrdad Sohrabi\n\nAFFILIATION:\n University of Wat
 erloo\n\nROOM:\n MC 6029\n\nABSTRACT: We are going to talk about approxim
 ating graphic TSP\, which\nis a variant of TSP where the distances come fr
 om shortest paths\nbetween vertices of an undirected graph. We will talk a
 bout Mömke and\nSvensson’s approach\, which used matchings to improve t
 he\napproximation ratio\, and also our recent generalization that uses\nb-
 matchings. This is joint work with Levent Tunçel and Swati Gupta.
DTSTAMP:20261113T211939Z
END:VEVENT
END:VCALENDAR