Fetching the paper…
Reading the bibliography…
In this paper we give a construction of cut sparsifiers of Benczur and Karger in the {\em dynamic} streaming setting in a single pass over the data stream.
Chernoff-hoeffding bounds for applications with limited independence
Jeanette P. Schmidt, Alan Siegel, and Aravind Srinivasan · 1995
Earlier work this paper cites.
Approximating s-t
András A. Benczúr and David R. Karger · 1996
Earlier work this paper cites.
Computing on data streams
M.R. Henzinger, P. Raghavan, and S. Rajagopalan · 1998
Earlier work this paper cites.
Random sampling in cut, flow, and network design problems
D. Karger · 1999
Earlier work this paper cites.
Stable distributions, pseudorandom generators, embeddings and data stream computation
P. Indyk · 2000
Earlier work this paper cites.
Random sampling in residual graphs
D. Karger and M. Levine · 2002
Earlier work this paper cites.
On graph problems in a semi-streaming model
J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang · 2005
Earlier work this paper cites.
Combinatorial algorithms for compressed sensing
G. Cormode and S. Muthukrishnan · 2006
Earlier work this paper cites.
Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
E.J. Candès, J. Romberg, and T. Tao · 2006
Cited alongside, same era.
Compressed sensing
D.L. Donoho · 2006
Cited alongside, same era.
Data streams: algorithms and applications
S. Muthukrishnan · 2006
Cited alongside, same era.
Graph sparsification by effective resistances
D.A. Spielman and N. Srivastava · 2008
Cited alongside, same era.
Spectral sparsification of graphs
D.A. Spielman and S.H. Teng · 2008
Cited alongside, same era.
Graph mining on streams
A. McGregor · 2009
Later among the works it cites.
Sparse recovery using sparse matrices
A. Gilbert and P. Indyk · 2010
Later among the works it cites.
Subgraph sparsification and nearly optimal ultrasparsifiers
Alexandra Kolla, Yury Makarychev, Amin Saberi, and Shang-Hua Teng · 2010
Later among the works it cites.
A general framework for graph sparsification
Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, and Debmalya Panigrahi · 2011
Later among the works it cites.
Spectral sparsification in the semi-streaming setting
Jonathan A. Kelner and Alex Levin · 2011
Later among the works it cites.
Analyzing graph structure via linear measurements
Kook Jin Ahn, Sudipto Guha, and Andrew McGregor · 2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
K. Ahn and S. Guha · 2009
Cited alongside, same era.
Joshua D. Batson, Daniel A. Spielman, and Nikhil Srivastava · 2009
Cited alongside, same era.
Graph partitioning using single commodity flows
R. Khandekar, S. Rao, and U. Vazirani · 2009
Cited alongside, same era.
Spectral sparsification via random spanners
Michael Kapralov and Rina Panigrahy · 2012
Closest in time.