Extensions and limits to vertex sparsification

Suppose we are given a graph G = (V, E) and a set of terminals K ⊂ V. We consider the problem of constructing a graph H = (K, E[subscript H]) that approximately preserves the congestion of every multicommodity flow with endpoints supported in K. We refer to such a graph as a flow sparsifier. We prov...

Full description

Bibliographic Details
Main Authors: Moitra, Ankur (Contributor), Leighton, Frank Thomson (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Mathematics (Contributor)
Format: Article
Language:English
Published: Association for Computing Machinery (ACM), 2013-09-20T16:01:50Z.
Subjects:
Online Access:Get fulltext