Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains

Manuel Bodirsky, Marcello Mamino, Caterina Viola

Valued constraint satisfaction problems (VCSPs) are a large class of combinatorial optimisation problems. It is desirable to classify the computational complexity of VCSPs dependin…