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:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d3d7b42718d
DTSTART;TZID=America/Toronto:20210115T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210115T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-anupam-gupta-1
SUMMARY:Tutte Colloquium: Anupam Gupta
CLASS:PUBLIC
DESCRIPTION:TITLE: Finding and Counting k-cuts in Graphs\n\nSpeaker:\n Anu
 pam Gupta\n\nAffiliation:\n\nCarnegie Mellon University\n\nZoom:\n Please 
 email Emma Watson\n\nABSTRACT:\n\nFor an undirected graph with edge weigh
 ts\, a k-cut is a set of edges\nwhose deletion breaks the graph into at le
 ast k connected components.\nHow fast can we find a minimum-weight k-cut? 
 And how many minimum\nk-cuts can a graph have? The two problems are closel
 y linked. In 1996\nKarger and Stein showed how to find a minimum k-cut in 
 approximately\nn^{2k-2} time\; their proof also bounded the number of mini
 mum k-cuts\nby n^{2k-2}\, using the probabilistic method.
DTSTAMP:20260406T155636Z
END:VEVENT
END:VCALENDAR