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:69cf6a78c39f4
DTSTART;TZID=America/Toronto:20250619T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250619T143000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-nikhil-kumar-1
SUMMARY:C&O Reading Group -Nikhil Kumar
CLASS:PUBLIC
DESCRIPTION:TITLE: Almost Tight Additive Guarantees for k-Edge-Connectivit
 y\n\nSPEAKER:\n Nikhil Kumar\n\nAFFILIATION:\n University of Waterloo\n\nL
 OCATION:\n MC 6029\n\nABSTRACT: We consider the k-edge-connected spanning 
 subgraph (k-ECSS)\nproblem\, where we are given an undirected graph G = (V
 \, E) with\nnonnegative edge costs\, and the goal is to find a minimum-cos
 t\nsubgraph H of G that is k-edge-connected\; that is\, there exist at\nle
 ast k edge-disjoint paths between every pair of vertices in H.\n\nFor even
  k\, we present a polynomial-time algorithm that computes a\n(k−2)-edge-
 connected subgraph whose cost is at most that of the\nnatural LP relaxatio
 n of k-ECSS. I will try to present an overview of\nour algorithm and analy
 sis\, which is based on the iterative rounding\ntechnique.
DTSTAMP:20260403T072128Z
END:VEVENT
END:VCALENDAR