Pliability and approximating max-CSPs
We identify a sufficient condition, treewidth-pliability, that gives a polynomial-time algorithm for an arbitrarily good approximation of the optimal value in a large class of Max-2-CSPs parameterised by the class of allowed constraint graphs (with arbitrary constraints on an unbounded alphabet). Ou...
主要な著者: | Romero, M, Wrochna, M, Zivny, S |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
Association for Computing Machinery
2023
|
類似資料
-
Treewidth-pliability and PTAS for Max-CSPs
著者:: Romero, M, 等
出版事項: (2021) -
Point-width and Max-CSPs
著者:: Carbonnel, C, 等
出版事項: (2020) -
Point-width and max-CSPs
著者:: Carbonnel, C, 等
出版事項: (2019) -
PTAS for sparse general-valued CSPs
著者:: Mezei, B, 等
出版事項: (2023) -
PTAS for sparse general-valued CSPs
著者:: Mezei, BF, 等
出版事項: (2021)