Sketching Cuts in Graphs and Hypergraphs
Dmitry Kogan, Robert Krauthgamer

TL;DR
This paper explores sketching and streaming algorithms for cut problems in graphs and hypergraphs, establishing space complexity bounds and introducing cut-sparsifiers, with initial work on general CSPs.
Contribution
It provides new space complexity bounds for approximating Max-Cut in streaming models and introduces cut-sparsifiers for hypergraphs, along with initial steps for sketching general CSPs.
Findings
Max-Cut approximation requires near-linear space in streaming.
Hypergraph cut-sparsifiers with O(ε^{-2} n (r+log n)) edges exist.
First steps towards sketching general CSPs.
Abstract
Sketching and streaming algorithms are in the forefront of current research directions for cut problems in graphs. In the streaming model, we show that -approximation for Max-Cut must use space; moreover, beating -approximation requires polynomial space. For the sketching model, we show that -uniform hypergraphs admit a -cut-sparsifier (i.e., a weighted subhypergraph that approximately preserves all the cuts) with edges. We also make first steps towards sketching general CSPs (Constraint Satisfaction Problems).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Stochastic Gradient Optimization Techniques · Optimization and Search Problems
