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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf76d4e3e2c
DTSTART;TZID=America/Toronto:20250805T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250805T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-richard-peng-cmu
SUMMARY:Graphs and Matroids - Richard Peng (CMU)
CLASS:PUBLIC
DESCRIPTION:TITLE: Approximating Distances on Undirected Graphs\n\nSPEAKER
 :\n Richard Peng \n\nAFFILIATION:\n Carnegie Mellon University\n\nROOM:\n
  MC 5501\n\nABSTRACT: The shortest path metric on undirected graphs is a\
 nfundamental quantity with deep connections to combinatorics and\nstructur
 al graph theory. Tools built around such approximations are\nplaying incre
 asingly important role in efficient optimization\nalgorithms and data stru
 ctures. This talk will introduce such\napproximations starting from the br
 eadth first search tree\, and build\nupon them to discuss distance oracles
  and oblivious routings.
DTSTAMP:20260403T081412Z
END:VEVENT
END:VCALENDAR