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:69cf1a9aaba8d
DTSTART;TZID=America/Toronto:20230619T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230619T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-nathan-benedetto-proenca
SUMMARY:C&O Reading Group - Nathan Benedetto Proenca
CLASS:PUBLIC
DESCRIPTION:TITLE: A Primal-Dual Extension of the Goemans--Williamson Algo
 rithm\nfor the Weighted Fractional Cut Covering Problem\n\nSPEAKER:\n Nath
 an Benedetto Proenca\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION:
 \n MC 6029\n\nABSTRACT: \n\nA cut in a graph \\(G = (V\, E)\\) is a set of
  edges which has precisely\none endpoint in \\(S\\)\, for a given subset \
 \(S\\) of \\(V\\). The\nfractional cut-covering number is the optimal valu
 e of a linear\nprogramming relaxation for the problem of covering each edg
 e by a set\nof cuts. We define a semidefinite programming relaxation of fr
 actional\ncut covering whose approximate optimal solutions may be rounded 
 into a\nfractional cut cover via a randomized algorithm.
DTSTAMP:20260403T014042Z
END:VEVENT
END:VCALENDAR