A dichotomy theorem for the general minimum cost homomorphism problem

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 5, Issue , 2010, Pages 657-668

  Takhanov, Rustem ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

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

Indexed keywords

ALGEBRAIC METHOD; ALGEBRAIC TECHNIQUES; COMBINATORIAL OPTIMIZATION PROBLEMS; CONCRETE APPLICATIONS; DEFENCE LOGISTICS; DICHOTOMY THEOREM; MINIMUM COST HOMOMORPHISM; PERFECT GRAPH;

ALGEBRA; COMPUTER SCIENCE; CONSTRAINT SATISFACTION PROBLEMS; SUPERVISED LEARNING;

COSTS;

EID: 84880277745     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2010.2493     Document Type: Conference Paper

References (17)

1. Baker K., Pixley A. Polynomial interpolation and the Chinese remainder theorem for algebraic systems. Math. Z., 1975, 143, no. 2, pp. 165-174.
2. Bodnarcuk V.G., Kalužnin L.A., Kotov N.N., Romov B.A. Galois theory for Post algebras. Kibernetika, Kiev, 1969, no. 3, pp. 1-10, no. 5, pp. 1-9. (in Russian)
3. Bulatov A. Tractable conservative Constraint Satisfaction Problems. Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, 2003, pp. 321-330.
4. Chudnovsky M., Robertson N., Seymour P., Thomas R. The strong perfect graph theorem. Annals of Mathematics, 2006, no. 164, pp. 51-229.
5. Cohen D., Cooper M., Jeavons P. An algebraic characterisation of complexity for valued constraints. Proceedings of the 12th International Conference on Principles and Practice of Contraint Programming, 2006, pp. 107-121.
6. Feder T., Vardi M. Y. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM Journal on Computing, 1999, no. 28(1), pp. 57-104.
7. Geiger D. Closed Systems of Functions and Predicates. Pacific Journal of Mathematics, 1968, no. 27, pp. 95-100.
8. Gupta A., Hell P., Karimi M., Rafiey A. Minimum cost homomorphisms to reflexive digraphs. LATIN, 2008.
9. Gutin G., Hell P., Rafiey A., Yeo A. A dichotomy for minimum cost graph homomorphisms. European Journal of Combinatorics, 2008, Volume 29, Issue 4, pp. 900-911.
10. Gutin G., Hell P., Rafiey A., Yeo A. Minimum cost and list homomorphisms to semicomplete digraphs. Discrete Appl. Math., 2006, Volume 154, pp. 890-897.
11. Gutin G., Rafiey A., Yeo A., Tso M. Level of repair analysis and minimum cost homomorphisms of graphs. Discrete Applied Mathematics, no. 154(6), pp. 881-889.
12. Gutin G., Rafiey A., Yeo A. Minimum Cost Homomorphism Dichotomy for Oriented Cycles. Proceedings of AAIM'08, Lecture Notes in Computer Science, 2008, 5034, pp. 224-234.
13. Jeavons P. On the Algebraic Structure of Combinatorial Problems. Theoretical Computer Science, 1998, no. 200, 1-2, pp. 185-204.
14. Jégou P. Decomposition of domains based on the micro-structure of finite constraint satisfaction problems. Proceedings of the 11th National Conference on Artificial Intelligence, 1993, pp. 731-736.
15. Post E. The two-valued iterative systems of mathematical logic. Annals of Mathematical Studies, Princeton University Press, 1941, no. 5.
16. Rafiey A., Hell P. Duality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms. http://arxiv.org/abs/0907.3016v1
17. Schaefer T.J. The complexity of satisfiability problems. Proc 10th ACM Symposium on Theory of Computing (STOC), 1978, pp. 216-226.