@InProceedings{takhanov:LIPIcs.STACS.2010.2493,
author = {Takhanov, Rustem},
title = {{A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem}},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science},
pages = {657--668},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-16-3},
ISSN = {1868-8969},
year = {2010},
volume = {5},
editor = {Marion, Jean-Yves and Schwentick, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2493},
URN = {urn:nbn:de:0030-drops-24936},
doi = {10.4230/LIPIcs.STACS.2010.2493},
annote = {Keywords: Minimum cost homomorphisms problem, relational clones, constraint satisfaction problem, perfect graphs, supervised learning}
}