Additive sparsification of CSPs
Multiplicative cut sparsifiers, introduced by Bencz´ur and Karger [STOC’96], have proved extremely influential and found various applications. Precise characterisations were established for sparsifiability of graphs with other 2-variable predicates on Boolean domains by Filtser and Krauthgamer [SIDM...
Prif Awduron: | Pelleg, E, Zivny, S |
---|---|
Fformat: | Journal article |
Iaith: | English |
Cyhoeddwyd: |
Association for Computing Machinery
2023
|
Eitemau Tebyg
-
Additive sparsification of CSPs
gan: Pelleg, E, et al.
Cyhoeddwyd: (2021) -
Sparsification of binary CSPs
gan: Butti, S, et al.
Cyhoeddwyd: (2020) -
Sparsification of Binary CSPs
gan: Butti, S, et al.
Cyhoeddwyd: (2019) -
On planar valued CSPs
gan: Fulla, P, et al.
Cyhoeddwyd: (2016) -
On planar valued CSPs
gan: Fulla, P, et al.
Cyhoeddwyd: (2017)