Corpus ID: 2764582

The Sketching Complexity of Graph Cuts

@article{Andoni2014TheSC,
  title={The Sketching Complexity of Graph Cuts},
  author={A. Andoni and Robert Krauthgamer and D. Woodruff},
  journal={ArXiv},
  year={2014},
  volume={abs/1403.7058}
}

A. Andoni, Robert Krauthgamer, D. Woodruff

Published 2014

Mathematics, Computer Science

ArXiv

We study the problem of sketching an input graph, so that given the sketch, one can estimate the weight of any cut in the graph within factor $1+\epsilon$. We present lower and upper bounds on the size of a randomized sketch, focusing on the dependence on the accuracy parameter $\epsilon>0$. First, we prove that for every $\epsilon > 1/\sqrt n$, every sketch that succeeds (with constant probability) in estimating the weight of all cuts $(S,\bar S)$ in an $n$-vertex graph (simultaneously), must… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed