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