Output details
11 - Computer Science and Informatics
Royal Holloway, University of London
Return to search
Output 0 of 0 in the submission
Article title
A Dichotomy for Minimum Cost Graph Homomorphisms
Type
D - Journal article
Title of journal
European Journal of Combinatorics
Article number
-
Volume number
29
Issue number
4
First page of article
900
ISSN of journal
0195-6698
Year of publication
2008
Number of additional authors
3
Additional information
<12> The paper was an invited (peer reviewed) submission to the special issue of the European Journal of Combinatorics on graph homomorphisms. It motivated further research on the minimum cost homomorphism problem (MCHP) for digraphs and relational structures. In particular, Takhanov (STACS 2010) obtained a general characterization for MCHP on relational structures. The characterisation obtained in the paper has applications in Level of Repair Analysis (LORA) in logistics and the paper inspired further work on LORA , see e.g., Basten et al., Annals of Operations Research 172 (2009).
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Centre for Algorithms and their Applications
Citation count
20
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
