BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Vertex sparsifiers: New results from old techniques (and some open
  questions) - Krauthgamer\, R (Weizmann Institute of Science)
DTSTART:20110110T113000Z
DTEND:20110110T123000Z
UID:TALK28832@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:Given a capacitated graph G = (V\,E) and a set of terminals $K
   ubseteq V$\, how should we produce a graph H only on the terminals K so 
 that every (multicommodity) flow between the terminals in G could be suppo
 rted in H with low congestion\, and vice versa? (Such a graph H is called 
 a flow-sparsifier for G.) What if we want H to be a ``simple'' graph? What
  if we allow H to be a convex combination of simple graphs? And is the que
 stion easier if we wanted H to maintain the distances among the terminals 
 (rather than flows)? \n\nJoint work with Matthias Englert\, Anupam Gupta\,
  Robert Krauthgamer\, Harald Raecke\, Inbal Talgam-Cohen and Kunal Talwar.
  \n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR