Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

STACS

2010

Springer

2010

Springer

Abstract. In the constraint satisfaction problem (CSP), the aim is to ﬁnd an assignment of values to a set of variables subject to speciﬁed constraints. In the minimum cost homomorphism problem (MinHom), one is additionally given weights cva for every variable v and value a, and the aim is to ﬁnd an assignment f to the variables that minimizesP v cvf(v). Let MinHom (Γ) denote the MinHom problem parameterized by the set of predicates allowed for constraints. MinHom (Γ) 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 (Γ) 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 (Γ) for all choices of Γ. Our result settles a general dichotomy conjecture previously resolved only for certain classes of directed graphs, [Gutin, Hell, Raﬁey,...

Related Content

Added |
09 Jul 2010 |

Updated |
09 Jul 2010 |

Type |
Conference |

Year |
2010 |

Where |
STACS |

Authors |
Rustem Takhanov |

Comments (0)