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...
Prif Awduron: | Romero, M, Wrochna, M, Zivny, S |
---|---|
Fformat: | Journal article |
Iaith: | English |
Cyhoeddwyd: |
Association for Computing Machinery
2023
|
Eitemau Tebyg
-
Treewidth-pliability and PTAS for Max-CSPs
gan: Romero, M, et al.
Cyhoeddwyd: (2021) -
Point-width and Max-CSPs
gan: Carbonnel, C, et al.
Cyhoeddwyd: (2020) -
Point-width and max-CSPs
gan: Carbonnel, C, et al.
Cyhoeddwyd: (2019) -
PTAS for sparse general-valued CSPs
gan: Mezei, B, et al.
Cyhoeddwyd: (2023) -
PTAS for sparse general-valued CSPs
gan: Mezei, BF, et al.
Cyhoeddwyd: (2021)