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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e3f2838b194
DTSTART;TZID=America/Toronto:20230424T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230424T113000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-nathan-benedetto-proenca
SUMMARY:Algebraic Graph Theory - Nathan Benedetto Proenca
CLASS:PUBLIC
DESCRIPTION:Title: A Primal-Dual Extension of the Goemans and Williamson Al
 gorithm\nfor Weighted Fractional Cut Cover\n\nSpeaker:\n Nathan Benedetto 
 Proenca\n\nAffiliation:\n University of Waterloo\n\nLocation:\n Please con
 tact Sabrina Lato for Zoom link\n\nAbstract: A cut in a graph G = (V\, E) 
 is a set of edges which has one\nendpoint in S\, for a given subset S of V
 . The fractional cut-covering\nnumber is the optimal value of a linear pro
 gramming relaxation for the\nproblem of covering each edge by a set of cut
 s. Beyond its role as\npart of Šámal's work on cut continuous functions\
 , this graph\nparameter also arises as the gauge dual of the maximum cut p
 roblem.
DTSTAMP:20260418T210715Z
END:VEVENT
END:VCALENDAR