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
    11 Citations

    Topics from this paper

    A Sketching Algorithm for Spectral Graph Sparsification
    • 1
    • PDF
    Sketching Cuts in Graphs and Hypergraphs
    • 55
    • PDF
    Towards Resistance Sparsifiers
    • 8
    • PDF
    Sparsification of Two-Variable Valued CSPs
    • PDF
    Space Lower Bounds for Itemset Frequency Sketches
    • 8
    • PDF
    Constant Arboricity Spectral Sparsifiers
    • 1
    • PDF
    Data Streams and Applications in Computer Science
    • 2
    • PDF

    References

    SHOWING 1-10 OF 34 REFERENCES
    Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
    • 73
    • PDF
    Graph Sparsification via Refinement Sampling
    • 17
    • PDF
    Sketching Cuts in Graphs and Hypergraphs
    • 55
    • PDF
    A general framework for graph sparsification
    • 125
    • PDF
    Expanders via random spanning trees
    • 66
    • PDF
    Twice-ramanujan sparsifiers
    • 376
    • PDF
    Spectral Sparsification in the Semi-streaming Setting
    • 135
    • PDF
    Graph sketches: sparsification, spanners, and subgraphs
    • 233
    • PDF
    Approaching Optimality for Solving SDD Linear Systems
    • 237
    • PDF
    Single pass sparsification in the streaming model with edge deletions
    • 34
    • PDF