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...
मुख्य लेखकों: | Pelleg, E, Zivny, S |
---|---|
स्वरूप: | Journal article |
भाषा: | English |
प्रकाशित: |
Association for Computing Machinery
2023
|
समान संसाधन
-
Additive sparsification of CSPs
द्वारा: Pelleg, E, और अन्य
प्रकाशित: (2021) -
Sparsification of binary CSPs
द्वारा: Butti, S, और अन्य
प्रकाशित: (2020) -
Sparsification of Binary CSPs
द्वारा: Butti, S, और अन्य
प्रकाशित: (2019) -
On planar valued CSPs
द्वारा: Fulla, P, और अन्य
प्रकाशित: (2016) -
On planar valued CSPs
द्वारा: Fulla, P, और अन्य
प्रकाशित: (2017)