Dalmau, Víctor; Krokhin, Andrei; Manokaran, Rajsekar
(SIAM (Society for Industrial and Applied Mathematics), 2015)
We study the approximability of Minimum Constraint Satisfaction Problems (Min CSPs) with a fixed finite constraint language Γ on an arbitrary finite domain. The goal in such a problem is to minimize the number of unsatisfied ...