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:69ead4a3ea508
DTSTART;TZID=America/Toronto:20250819T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250819T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-niv-buchbinder
SUMMARY:Tutte Colloquium - Niv Buchbinder
CLASS:PUBLIC
DESCRIPTION:TITLE: Deterministic Algorithms and Faster Algorithms for Subm
 odular\nMaximization subject to a Matroid Constraint\n\nSPEAKER:\n Niv Buc
 hbinder\n\nAFFILIATION:\n Statistics and Operations Research at Tel Aviv u
 niversity\n\nLOCATION:\n MC 5501\n\nABSTRACT: Maximization of submodular 
 functions under various\nconstraints is a fundamental problem that has bee
 n studied\nextensively.\n\nIn this talk I will discuss submodular function
 s and interesting\nresearch questions in the field.\n\nI will present seve
 ral new techniques that lead to both deterministic\nalgorithms and faster 
 randomized algorithms for maximizing submodular\nfunctions.\n\nIn particul
 ar\, for monotone submodular functions subject to a matroid\nconstraint we
  design a deterministic non-oblivious local search\nalgorithm that has an 
 approximation guarantee of 1 - 1/e - \\eps (for\nany \\eps > 0)\, vastly i
 mproving over the previous state-of-the-art\n0.5008-approximation.\n\nFor 
 general (non-monotone) submodular functions we introduce a new\ntool\, tha
 t we refer to as the extended multilinear extension\, designed\nto derando
 mize submodular maximization algorithms that are based on\nthe successful 
 ``solve fractionally and then round'' approach.\n\nSHORT BIO: Niv Buchbind
 er is a professor in the department of\nStatistics and Operations Research
  at Tel Aviv university. He\nreceived his Ph.D. in Computer Science from 
 the Technion\, Israel in\n2008\, and then spent two years as a post-doctor
 al researcher at\nMicrosoft Research\, New England\, MA. His primary resea
 rch interests\nare algorithms for combinatorial optimization problems in o
 ffline and\nonline settings.
DTSTAMP:20260424T022539Z
END:VEVENT
END:VCALENDAR