Vertex Sparsifiers and Abstract Rounding Algorithms

Moses Charikar, Tom Leighton, Shi Li +1

The notion of vertex sparsification is introduced in \cite{M}, where it was shown that for any graph $G=(V,E)$ and a subset of $k$ terminals $K\subset V$, there is a polynomial…