Minimum cost homomorphism dichotomy for oriented cycles

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

Volumn 5034 LNCS, Issue , 2008, Pages 224-234

  Gutin, Gregory ^a   Rafiey, Arash ^b   Yeo, Anders ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS;

ALGORITHMIC ASPECTS; INTERNATIONAL CONFERENCES; MINIMUM COSTS;

INFORMATION MANAGEMENT;

EID: 48249129641     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68880-8_22     Document Type: Conference Paper

References (18)

1. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2000)
2. Feder, T.: Homomorphisms to oriented cycles and k-partite satisfiability. SIAM J. Discrete Math. 14, 471-480 (2001)
3. Feder, T., Hell, P., Rafiey, A.: List homomorphism to balanced digraphs (submitted)
4. Gupta, A., Hell, P., Karimi, M., Rafiey, A.: Minimum cost homomorphisms to reflexive digraphs. In: LATIN 2008 (to appear, 2008)
5. Gutin, G., Hell, P., Rafiey, A., Yeo, A.: Minimum Cost Homomorphisms to Proper Interval Graphs and Bigraphs. Europ. J. Combin. (to appear)
6. Gutin, G., Rafiey, A., Yeo, A.: Minimum Cost and List Homomorphisms to Semi-complete Digraphs. Discrete Appl. Math. 154, 890-897 (2006)
7. Gutin, G., Rafiey, A., Yeo, A.: Minimum Cost Homomorphisms to Semicomplete Multipartite Digraphs. Discrete Applied Math. (to apear)
8. Gutin, G., Rafiey, A., Yeo, A.: Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs (submitted)
9. Gutin, G., Rafiey, A., Yeo, A., Tso, M.: Level of repair analysis and minimum cost homomorphisms of graphs. Discrete Appl. Math. 154, 881-889 (2006); Preliminary version appeared. In: Megiddo, N., Xu, Y., Zhu, B. (eds.): AAIM 2005. LNCS, vol. 3521, pp. 427-439. Springer, Heidelberg (2005)
10. Gutjahr, W.: Graph Colourings, PhD thesis, Free University, Berlin (1991)
11. Häggkvist, R., Hell, P., Miller, D.J., Neumann-Lara, V.: On multiplicative graphs and the product conjecture. Combinatorica 8, 63-74 (1988)
12. Halldorsson, M.M., Kortsarz, G., Shachnai, H.: Minimizing average completion of dedicated tasks and interval graphs. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, pp. 114-126. Springer, Heidelberg (2001)
13. Feder, T., Hell, P., Huang, J.: List homomorphisms and circular arc graphs. Combinatorica 19, 487-505 (1999)
14. Hell, P., Nešetřil, J.: On the complexity of H-colouring. J. Combin. Theory B 48, 92-110 (1990)
15. Hell, P., Nešetřil, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)
16. Hell, P., Zhu, X.: The existence of homomorphisms to oriented cycles. SIAM J. Discrete Math. 8, 208-222 (1995)
17. Jansen, K.: Approximation results for the optimum cost chromatic partition problem. J. Algorithms 34, 54-89 (2000)
18. Zhu, X.: A simple proof of the multipilicatively of directed cycles of prime power length. Discrete Appl. Math. 36, 333-345 (1992)