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:69d33afdba3ec
DTSTART;TZID=America/Toronto:20180815T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180815T133000
URL:https://uwaterloo.ca/computer-science/events/masters-thesis-presentatio
 n-algorithms-and-complexity
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 2310 Waterloo ON N2L 3G1 Canada
SUMMARY:Master’s Thesis Presentation • Algorithms and Complexity — Th
 e\nComplexity of Network Design for s-t Effective Resistance
CLASS:PUBLIC
DESCRIPTION:PAK HAY CHAN\, MASTER’S CANDIDATE\n_David R. Cheriton School 
 of Computer Science_\n\nWe consider a new problem of designing a network w
 ith small $s$-$t$\neffective resistance. In this problem\, we are given an
  undirected\ngraph $G=(V\,E)$ where each edge $e$ has a cost $c_e$ and a r
 esistance\n$r_e$\, two designated vertices $s\,t \\in V$\, and a cost budg
 et $k$.
DTSTAMP:20260406T044757Z
END:VEVENT
END:VCALENDAR