2 papers
cs.CC2020
On Regularity of Max-CSPs and Min-CSPs
Aleksa Stankovic
We study approximability of regular constraint satisfaction problems, i.e., CSPs where each variable in an instance has the same number of occurrences. In particular, we show that…
cs.CC2019
Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder
Per Austrin, Aleksa Stankovic
Assuming the Unique Games Conjecture, we show that existing approximation algorithms for some Boolean Max-2-CSPs with cardinality constraints are optimal. In particular, we prove t…