Single pass sparsification in the streaming model with edge deletions [article]

Ashish Goel and Michael Kapralov and Ian Post
2012 arXiv   pre-print
In this paper we give a construction of cut sparsifiers of Benczur and Karger in the dynamic streaming setting in a single pass over the data stream. Previous constructions either required multiple passes or were unable to handle edge deletions. We use Õ(1/^2) time for each stream update and Õ(n/^2) time to construct a sparsifier. Our -sparsifiers have O(n^3 n/^2) edges. The main tools behind our result are an application of sketching techniques of Ahn et al.[SODA'12] to estimate edge
more » ... ty together with a novel application of sampling with limited independence and sparse recovery to produce the edges of the sparsifier.
arXiv:1203.4900v1 fatcat:qjjlfeaoonhsjgafpjnhw6aebq