A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem.

Rustem Takhanov

Published in: STACS (2010)

Keyphrases

minimum cost
np hard
special case
approximation algorithms
network flow
polynomially solvable
spanning tree
network simplex algorithm
search algorithm
dynamic programming
capacity constraints