Extensions of the minimum cost homomorphism problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6196 LNCS, Issue , 2010, Pages 328-337

  Takhanov, Rustem ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT LANGUAGE; CONSTRAINT PROBLEMS; FINITE SET; MINIMUM COST HOMOMORPHISM; NATURAL NUMBER; NP COMPLETE; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME; SOLUTION PROBLEMS; UNARY RELATIONS;

LINGUISTICS; OPTIMIZATION; QUERY LANGUAGES; SET THEORY;

COSTS;

EID: 77955018422     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14031-0_36     Document Type: Conference Paper

References (19)

1. Bodnarcuk, V.G., Kalüznin, L.A., Kotov, N.N., Romov, B.A.: Galois theory for Post algebras. Kibernetika 3(1-10), 5 (1-9) (in Russian)
2. Bulatov, A.A.: Tractable conservative Constraint Satisfaction Problems. In: 18th Annual IEEE Symposium on Logic in Computer Science, pp. 321-330 (2003)
3. Cohen, D., Cooper, M., Jeavons, P.: Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Theor. Comput. Sci. 401, 36-51 (2008)
4. Daniels, H., Velikova, M.: Derivation of monotone decision models from nonmonotone data. Tilburg University, Center Internal Report 30 (2003)
5. 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 28, 57-104 (1999)
6. Geiger, D.: Closed Systems of Functions and Predicates. Pacific Journal of Mathematics 27, 95-100 (1968)
7. Gupta, A., Hell, P., Karimi, M., Rafiey, A.: Minimum cost homomorphisms to reflexive digraphs. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.4957, pp. 182-193. Springer, Heidelberg (2008)
8. Gutin, G., Hell, P., Rafiey, A., Yeo, A.: A dichotomy for minimum cost graph homomorphisms. European Journal of Combinatorics 29, 900-911 (2008)
9. Gutin, G., Hell, P., Rafiey, A., Yeo, A.: Minimum cost and list homomorphisms to semicomplete digraphs. Discrete Appl. Math. 154, 890-897 (2006) (Pubitemid 43344189)
10. Gutin, G., Rafiey, A., Yeo, A., Tso, M.: Level of repair analysis and minimum cost homomorphisms of graphs. Discrete Applied Mathematics 154, 881-889 (2006)
11. Gutin, G., Rafiey, A., Yeo, A.: Minimum Cost Homomorphism Dichotomy for Oriented Cycles. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol.5034, pp. 224-234. Springer, Heidelberg (2008)
12. Jeavons, P.: On the Algebraic Structure of Combinatorial Problems. Theoretical Computer Science 200, 185-204 (1998)
13. Jonsson, P., Kuivinen, F., Nordh, G.: Max Ones generalised to larger domains. SIAM Journal on Computing 38, 329-365 (2008)
14. Jonsson, P., Nordh, G.: Generalised integer programming based on logically defined relations. In: Kŕalovíc, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.4162, pp. 549-560. Springer, Heidelberg (2006)
15. Jonsson, P., Nordh, G., Thapper, J.: The maximum solution problem on graphs. In: Kücera, L., Kücera, A. (eds.) MFCS 2007. LNCS, vol.4708, pp. 228-239. Springer, Heidelberg (2007)
16. Post, E.: The two-valued iterative systems of mathematical logic. Annals of Mathematical Studies 5 (1941)
17. Rafiey, A., Hell, P.: Duality for Min-Max Orderings and Dichotomy for Min Cost Homomorphisms, http://arxiv.org/abs/0907.3016v1
18. Schaefer, T.J.: The complexity of satisfiability problems. In: 10th ACM Symposium on Theory of Computing, pp. 216-226 (1978)
19. Takhanov, R.: A dichotomy theorem for the general minimum cost homomorphism problem. In: STACS (to appear, 2010)