BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Thin spanning trees and their algorithmic applications - Amin Sabe
 ri (Stanford University)
DTSTART:20160712T110000Z
DTEND:20160712T113000Z
UID:TALK66713@talks.cam.ac.uk
CONTACT:INI IT
DESCRIPTION:<span>Motivated by Jaeger&#39\;s modular orientation conjectur
 e\, Goddyn asked the following question:&nbsp\;<br> <br> A spanning tree o
 f a graph G is called epsilon-thin if it contains at most an epsilon fract
 ion of the edges of each cut in that graph. Is there a function f:(0\,1)&r
 arr\;</span>&#x2124\;<span> such that every f(epsilon)-edge-connected grap
 h has an epsilon-thin spanning tree?<br> &nbsp\;<br> I will talk about our
  journey in search of such thin trees\, their applications concerning trav
 eling salesman problems\, and unexpected connections to graph sparsificati
 on and the Kadison-Singer problem.<br> <br> Bio: <a href="http://stanford.
 edu/~saberi/bio.txt" target="_blank" rel="nofollow">http://stanford.edu/~s
 aberi/bio.txt</a></span>
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR