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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69ce9beb3344e
DTSTART;TZID=America/Toronto:20250919T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250919T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-joseph-cheriyan-0
SUMMARY:Tutte Colloquium - Joseph Cheriyan
CLASS:PUBLIC
DESCRIPTION:TITLE: Approximation Algorithms for Flexible Graph Connectivit
 y\n\nSPEAKER:\n Joseph Cheriyan\n\nAFFILIATION:\n University of Waterloo\n
 \nLOCATION:\n MC 5501\n\nABSTRACT: This is a \"non specialist\" talk on a
  couple of results from\na long-running project in the area of capacitated
  network design. The\nkey problem here is to find a sub-graph of minimum c
 ost that satisfies\na (global) edge connectivity requirement\, where the i
 nput is a graph G\nthat has a capacity u(e) and a cost c(e) for each edge 
 e in E(G).\n(Note: The minimum spanning tree problem is the special case w
 here the\nconnectivity requirement is one and  all edge-capacities are on
 e.)\n\nThe results in the talk are from joint work with Bansal\, Grout\,\n
 Ibrahimpur\, Khanna\, and Simmons.
DTSTAMP:20260402T164011Z
END:VEVENT
END:VCALENDAR