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)