51 citations · 203 across the 13 of their papers we have counts for
4 papers · 1 filter
Binary constraints on one additional variable can create exponential ascents for local search
David A. Cohen, Peter G. Jeavons, Artem Kaznatcheev +2
Local search in combinatorial optimisation can be viewed as an uphill climb on a corresponding fitness landscape, where the assignments visited by a strict local search follow an a…
Steepest ascent can be exponential in bounded treewidth problems
David A. Cohen, Martin C. Cooper, Artem Kaznatcheev +1
We investigate the complexity of local search based on steepest ascent. We show that even when all variables have domains of size two and the underlying constraint graph of variabl…
Binarisation for Valued Constraint Satisfaction Problems
David A. Cohen, Martin C. Cooper, Peter G. Jeavons +3
We study methods for transforming valued constraint satisfaction problems (VCSPs) to binary VCSPs. First, we show that the standard dual encoding preserves many aspects of the alge…
The Expressive Power of Binary Submodular Functions
Stanislav Zivny, David A. Cohen, Peter G. Jeavons
It has previously been an open problem whether all Boolean submodular functions can be decomposed into a sum of binary submodular functions over a possibly larger set of variables.…