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...
Váldodahkkit: | Pelleg, E, Zivny, S |
---|---|
Materiálatiipa: | Journal article |
Giella: | English |
Almmustuhtton: |
Association for Computing Machinery
2023
|
Geahča maid
-
Additive sparsification of CSPs
Dahkki: Pelleg, E, et al.
Almmustuhtton: (2021) -
Sparsification of binary CSPs
Dahkki: Butti, S, et al.
Almmustuhtton: (2020) -
Sparsification of Binary CSPs
Dahkki: Butti, S, et al.
Almmustuhtton: (2019) -
On planar valued CSPs
Dahkki: Fulla, P, et al.
Almmustuhtton: (2016) -
On planar valued CSPs
Dahkki: Fulla, P, et al.
Almmustuhtton: (2017)