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...
Egile Nagusiak: | Pelleg, E, Zivny, S |
---|---|
Formatua: | Journal article |
Hizkuntza: | English |
Argitaratua: |
Association for Computing Machinery
2023
|
Antzeko izenburuak
-
Additive sparsification of CSPs
nork: Pelleg, E, et al.
Argitaratua: (2021) -
Sparsification of binary CSPs
nork: Butti, S, et al.
Argitaratua: (2020) -
Sparsification of Binary CSPs
nork: Butti, S, et al.
Argitaratua: (2019) -
On planar valued CSPs
nork: Fulla, P, et al.
Argitaratua: (2016) -
On planar valued CSPs
nork: Fulla, P, et al.
Argitaratua: (2017)