A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains
unpublished
In this paper we study the computational complexity of the extended minimum cost homo-morphism 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. A wide range of natural combinatorial optimisation problems can be expressed as extended Min-Cost-Homs and a classification of their complexity would be highly desirable, both from a direct, applied point of view as well as from a theoretical
fatcat:xz43vsqmwza5tovq4zcmlnxo5q