A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Toward a Dichotomy for Approximation of H-coloring
[article]

2019
*
arXiv
*
pre-print

Given two (di)graphs G, H and a cost function c:V(G)× V(H) →Q_≥ 0∪{+∞}, in the minimum cost homomorphism problem, MinHOM(H), goal is finding a homomorphism f:V(G)→ V(H) (a.k.a H-coloring) that minimizes ∑_v∈ V(G)c(v,f(v)). The complexity of exact minimization of this problem is well understood [34], and the class of digraphs H, for which the MinHOM(H) is polynomial time solvable is a small subset of all digraphs. In this paper, we consider the approximation of MinHOM within a constant factor.

arXiv:1902.02201v3
fatcat:hvl3idprorehvhyrt5mgydbgni