BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Isaac Newton Institute Seminar Series
SUMMARY:Thin spanning trees and their algorithmic applicat
ions - Amin Saberi (Stanford University)
DTSTART;TZID=Europe/London:20160712T120000
DTEND;TZID=Europe/London:20160712T123000
UID:TALK66713AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/66713
DESCRIPTION:Motivated by Jaeger'\;s modular orientati
on conjecture\, Goddyn asked the following questio
n: \;
A spanning tree of a graph G is
called epsilon-thin if it contains at most an eps
ilon fraction of the edges of each cut in that gra
ph. Is there a function f:(0\,1)&rarr\;
124\; such that every f(epsilon)-edge-connec
ted graph has an epsilon-thin spanning tree?
&
nbsp\;
I will talk about our journey in search
of such thin trees\, their applications concernin
g traveling salesman problems\, and unexpected con
nections to graph sparsification and the Kadison-S
inger problem.
Bio: http://stanford.edu/~saberi/bio.txt
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:INI IT
END:VEVENT
END:VCALENDAR