Sparsification of Binary CSPs

A cut $\varepsilon$-sparsifier of a weighted graph $G$ is a re-weighted subgraph of $G$ of (quasi)linear size that preserves the size of all cuts up to a multiplicative factor of $\varepsilon$. Since their introduction by Benczur and Karger [STOC'96], cut sparsifiers have proved extremely influential and found various applications. Going beyond cut sparsifiers, Filtser and Krauthgamer [SIDMA'17] gave a precise classification of which binary Boolean CSPs are sparsifiable. In this paper, we extend their result to binary CSPs on arbitrary finite domains.

[1]  Nikhil Srivastava,et al.  Twice-ramanujan sparsifiers , 2008, STOC '09.

[2]  Robert Krauthgamer,et al.  Sparsification of Two-Variable Valued Constraint Satisfaction Problems , 2017, SIAM J. Discret. Math..

[3]  Debmalya Panigrahi,et al.  A general framework for graph sparsification , 2010, STOC '11.

[4]  Shang-Hua Teng,et al.  Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.

[5]  David R. Karger,et al.  Approximating s – t Minimum Cuts in ~ O(n 2 ) Time , 2007 .

[6]  Robert Krauthgamer,et al.  Sketching Cuts in Graphs and Hypergraphs , 2014, ITCS.

[7]  Vladimir Kolmogorov,et al.  The Complexity of General-Valued CSPs , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[8]  David P. Woodruff,et al.  On Sketching Quadratic Forms , 2015, ITCS.

[9]  Ilan Newman,et al.  On Multiplicative Lambda-Approximations and Some Geometric Applications , 2013, SIAM J. Comput..

[10]  Sudipto Guha,et al.  Graph Sparsification in the Semi-streaming Model , 2009, ICALP.

[11]  Shang-Hua Teng,et al.  Spectral Sparsification of Graphs , 2008, SIAM J. Comput..

[12]  Yuichi Yoshida,et al.  Spectral Sparsification of Hypergraphs , 2018, SODA.

[13]  Nikhil Srivastava,et al.  Graph sparsification by effective resistances , 2008, SIAM J. Comput..

[14]  Hubie Chen,et al.  Best-case and Worst-case Sparsifiability of Boolean CSPs , 2018, IPEC.

[15]  Frank Harary,et al.  Bigraphs versus digraphs via matrices , 1980, J. Graph Theory.