COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Vertex sparsifiers: New results from old techniques (and some open questions)

## Vertex sparsifiers: New results from old techniques (and some open questions)Add to your list(s) Download to your calendar using vCal - Krauthgamer, R (Weizmann Institute of Science)
- Monday 10 January 2011, 11:30-12:30
- Seminar Room 1, Newton Institute.
If you have a question about this talk, please contact Mustapha Amrani. Discrete Analysis 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 supported 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 question easier if we wanted H to maintain the distances among the terminals (rather than flows)? Joint work with Matthias Englert, Anupam Gupta, Robert Krauthgamer, Harald Raecke, Inbal Talgam-Cohen and Kunal Talwar. This talk is part of the Isaac Newton Institute Seminar Series series. ## This talk is included in these lists:- All CMS events
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
- bld31
Note that ex-directory lists are not shown. |
## Other listsTechnology Enterprise Group Seminar Series Design Anthropology Newnham College MCR Speaker Series## Other talksBeacon Salon #7 Imaging Far and Wide Aspects of adaptive Galerkin FE for stochastic direct and inverse problems The Chemistry of Planet Formation and the Making of Habitable Planets Barnum, Bache and Poe: the forging of science in the Antebellum US Making Smart Decisions in Systems Design: How to Engineer Decisions in a Connected World? |