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:6832c398892de
DTSTART;TZID=America/Toronto:20200724T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200724T133000
URL:/combinatorics-and-optimization/events/combinatoria
 l-optimization-reading-group-sharat-ibrahimpur-2
SUMMARY:Combinatorial Optimization Reading Group - Sharat Ibrahimpur
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: A 4/3-Approximation Algorithm for the Minim
 um 2-Edge\nConnected Multisubgraph Problem in the Half-Integral Case\n\nS
 peaker:\n Sharat Ibrahimpur\n\nAffiliation:\n University of À¶Ý®ÊÓƵ\n\nZo
 om:\n Contact Sharat Ibrahimpur\n\nABSTRACT:\n\nGiven a connected undirect
 ed graph G on n vertices\, and non-negative\nedge costs c\, the 2ECM probl
 em is that of finding a 2-edge connected\nspanning multisubgraph of G of m
 inimum cost. The natural linear\nprogram (LP) for 2ECM\, which coincides w
 ith the subtour LP for the\nTraveling Salesman Problem on the metric closu
 re of G\, gives a lower\nbound on the optimal cost.\n 
DTSTAMP:20250525T071536Z
END:VEVENT
END:VCALENDAR