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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d38cc823c0e
DTSTART;TZID=America/Toronto:20200724T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200724T133000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-sharat-ibrahimpur-2
SUMMARY:Combinatorial Optimization Reading Group - Sharat Ibrahimpur
CLASS:PUBLIC
DESCRIPTION:TITLE: A 4/3-Approximation Algorithm for the Minimum 2-Edge\nC
 onnected Multisubgraph Problem in the Half-Integral Case\n\nSpeaker:\n Sh
 arat Ibrahimpur\n\nAffiliation:\n University of Waterloo\n\nZoom:\n Contac
 t Sharat Ibrahimpur\n\nABSTRACT:\n\nGiven a connected undirected graph G o
 n n vertices\, and non-negative\nedge costs c\, the 2ECM problem is that o
 f finding a 2-edge connected\nspanning multisubgraph of G of minimum cost.
  The natural linear\nprogram (LP) for 2ECM\, which coincides with the subt
 our LP for the\nTraveling Salesman Problem on the metric closure of G\, gi
 ves a lower\nbound on the optimal cost.
DTSTAMP:20260406T103656Z
END:VEVENT
END:VCALENDAR