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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a10d054b9e41
DTSTART;TZID=America/Toronto:20260525T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260525T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-stephen-arndt-approximation-algorithms
SUMMARY:Graphs and Matroids - Stephen Arndt-Approximation Algorithms for\nM
 atroid-Intersection Coloring with Applications to Rota's Basis\nConjecture
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Stephen Arndt\n\nAFFILIATION:\n Carnegie Mellon Univ
 ersity\n\nROOM:\n MC 5417\n\nABSTRACT:We study algorithmic matroid interse
 ction coloring. We give\nthe first polynomial-time O(1)-approximation algo
 rithm to color O(1)\ngeneral matroids. Notably\, for two general matroids 
 we achieve a\n2-approximation. Furthermore\, we give a fully polynomial ra
 ndomized\napproximation scheme (FPRAS) for coloring the intersection of tw
 o\nmatroids when the maximum chromatic number is large. This yields the\nf
 irst polynomial-time algorithm for an asymptotic variant of Rota's\nBasis 
 Conjecture.
DTSTAMP:20260522T215324Z
END:VEVENT
END:VCALENDAR