Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs

For digraphs G and H, a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (G) is associated with costs ci(u), i ∈ V (H), then the cost of a homomorphism f is u∈V (G) cf(u)(u). For each fixed digraph H, the minimum cost homomorphism problem for H, denoted MinHOM(H), can be formulated as follows: Given an input digraph G, together with costs ci(u), u ∈ V (G), i ∈ V (H), decide whether there exists a homomorphism of G to H and, if one exists, to find one of minimum cost. Minimum cost homomorphism problems encompass (or are related to) many well studied optimization problems such as the minimum cost chromatic partition and repair analysis problems. We focus on the minimum cost homomorphism problem for locally semicomplete digraphs and quasi-transitive digraphs which are two well-known generalizations of tournaments. Using graph-theoretic characterization results for the two digraph classes, we...

• Type: Journal
• Year: 2007
• Where: CORR
• Authors: Arvind Gupta, Gregory Gutin, Mehdi Karimi, Eun Jung Kim, Arash Rafiey
• Keywords: CORR 2007, Education, Homomorphism, Minimum Cost, Minimum Cost Homomorphism