A Dichotomy Theorem for General Minimum Cost Homomorphism Problem

Details A Dichotomy Theorem for General Minimum Cost Homomorphism Problem A Dichotomy Theorem for General Minimum Cost Homomorphism Problem

2007-08-23

arxiv.org/abs/0708.3226v7

Computer Science

Learning

23 pages

Scientific paper

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 $\sum_{v} c_{vf(v)}$. Let $MinHom(\Gamma)$ denote the $MinHom$ problem parameterized by the set of predicates allowed for constraints. $MinHom(\Gamma)$ is related to many well-studied combinatorial optimization problems, and concrete applications can be found in, for instance, defence logistics and machine learning. We show that $MinHom(\Gamma)$ can be studied by using algebraic methods similar to those used for CSPs. With the aid of algebraic techniques, we classify the computational complexity of $MinHom(\Gamma)$ for all choices of $\Gamma$. Our result settles a general dichotomy conjecture previously resolved only for certain classes of directed graphs, [Gutin, Hell, Rafiey, Yeo, European J. of Combinatorics, 2008].

Affiliated with

Also associated with

No associations

Rating

A Dichotomy Theorem for General Minimum Cost Homomorphism Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Dichotomy Theorem for General Minimum Cost Homomorphism Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Dichotomy Theorem for General Minimum Cost Homomorphism Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-521977