Login / Signup
A Reduction from Valued CSP to Min Cost Homomorphism Problem for Digraphs.
Robert Powell
Andrei A. Krokhin
Published in:
CoRR (2015)
Keyphrases
</>
min cost
max flow
network flow
constraint satisfaction problems
combinatorial optimization problems
constraint satisfaction
parallel processors
directed graph
genetic algorithm