Login / Signup
Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains.
Hannes Uppman
Published in:
STACS (2014)
Keyphrases
</>
minimum cost
np hard
computational complexity
approximation algorithms
spanning tree
network flow
network flow problem
special case
np complete
capacity constraints
scheduling problem
network simplex algorithm
worst case
lower bound
integer programming