The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
A Dichotomy Theorem for General Minimum Cost Homomorphism Problem
[article]
2010
arXiv
pre-print
In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost homomorphism problem (MinHom), one is additionally given weights c_va for every variable v and value a, and the aim is to find an assignment f to the variables that minimizes ∑_v c_vf(v). Let MinHom(Γ) denote the MinHom problem parameterized by the set of predicates allowed for constraints. MinHom(Γ) is related to many well-studied
arXiv:0708.3226v7
fatcat:vh7cncsje5ccvm23kfb2d2g7lm