Sciweavers

CORR
2006
Springer
128views Education» more  CORR 2006»
13 years 11 months ago
Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). If, moreover, each vertex u V (D) is associated with costs ci(u), i...
Gregory Gutin, Arash Rafiey, Anders Yeo
STACS
2010
Springer
14 years 4 months ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov