Vertex Sparsifiers: New Results from Old Techniques

Matthias Englert, Anupam Gupta, Robert Krauthgamer +3

Given a capacitated graph $G=(V,E)$ and a set of terminals $K\subseteq V$, how should we produce a graph $H$ only on the terminals $K$ so that every (multicommodity) flow betwee…