A dichotomy theorem for the general minimum cost homomorphism problem

Research output: Chapter in Book/Report/Conference proceedingConference contribution

37 Citations (Scopus)

Abstract

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 cva 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 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, Rafiey, Yeo, European J. of Combinatorics, 2008].

Original languageEnglish
Title of host publicationSTACS 2010 - 27th International Symposium on Theoretical Aspects of Computer Science
Pages657-668
Number of pages12
DOIs
Publication statusPublished - Dec 1 2010
Event27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010 - Nancy, France
Duration: Mar 4 2010Mar 6 2010

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume5
ISSN (Print)1868-8969

Other

Other27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010
CountryFrance
CityNancy
Period3/4/103/6/10

Keywords

  • Constraint satisfaction problem
  • Minimum cost homomorphisms problem
  • Perfect graphs
  • Relational clones
  • Supervised learning

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'A dichotomy theorem for the general minimum cost homomorphism problem'. Together they form a unique fingerprint.

Cite this