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:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d912164cb83
DTSTART;TZID=America/Toronto:20180801T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180801T133000
URL:https://uwaterloo.ca/computer-science/events/masters-thesis-presentatio
 n-seminar-algorithms-and-0
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 1304 Waterloo ON N2L 3G1 Canada
SUMMARY:Master’s Thesis Presentation / Seminar • Algorithms and Complex
 ity\n— Minimum Shared-Power Edge Cut
CLASS:PUBLIC
DESCRIPTION:KSHITIJ JAIN\, MASTER’S CANDIDATE\n_David R. Cheriton School 
 of Computer Science_\n\nWe introduce a problem called the Minimum Shared-P
 ower Edge Cut\n(MSPEC). The input to the problem is an undirected edge-wei
 ghted graph\nwith distinguished vertices s and t\, and the goal is to find
  an s-t\ncut by assigning \"powers'' at the vertices and removing an edge 
 if the\nsum of the powers at its endpoints is at least its weight. The\nob
 jective is to minimize the sum of the assigned powers.
DTSTAMP:20260410T150702Z
END:VEVENT
END:VCALENDAR