We study the computational complexity of the extended minimum cost homomorphism problem (Min-Cost-Hom) as a function of a constraint language, i.e. a set of constraint relations and cost functions that are allowed to appear in instances.Expand

We study Max-Sur-CSP on the two-element domain and determine the computational complexity for all constraint languages (families of allowed constraints).Expand

In this paper the reflection-extension of one-dimensional quasiminimizers is studied.A brief introduction to quasiminimizers, focused on the one-dimensional ones, is given.The main result of the… Expand

We show that such languages also exist for the max ones problem (Max-Ones(Γ)) and the Boolean valued constraint satisfaction problem over finite-valued constraint languages.Expand

This paper considers scheduling of an integrated modular avionic system which from a more general perspective can be seen as a multiprocessor scheduling problem that includes a communication network.Expand

This thesis is about the computational complexity of several classes of combinatorial optimization problems, all related to the constraint satisfaction problems.A constraint language consists of a ...

Valued constraint satisfaction problems (VCSPs) are discrete optimisation problems with a (Q ∪ {∞ })-valued objective function given as a sum of fixed-arity functions.Expand

We study the computational complexity of the (extended) minimum cost homomorphism problem (Min-Cost-Hom) as a function of a constraint language, i.e. a set of constraint relations and cost functions that appear in instances.Expand