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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6870d270aa4f9
DTSTART;TZID=America/Toronto:20221118T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221118T153000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-vera-traub
SUMMARY:Tutte Colloquium - Vera Traub
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTitle: Approximating Weighted Connectivity Augmenta
 tion below Factor 2\n\nSpeaker:\n Vera Traub\n\nAffiliation:\n Research In
 stitute for Discrete Mathematics\, University of Bonn\n\nLocation:\n MC 55
 01 or contact Melissa Cambridge for Zoom link\n\nAbstract:  The Weighted 
 Connectivity Augmentation Problem (WCAP) asks\nto increase the edge-connec
 tivity of a graph in the cheapest possible\nway by adding edges from a giv
 en set. It is one of the most elementary\nnetwork design problems for whic
 h no better-than-2 approximation\nalgorithm has been known\, whereas 2-app
 roximations can be easily\nobtained through a variety of well-known techni
 ques.\n 
DTSTAMP:20250711T085928Z
END:VEVENT
END:VCALENDAR