Minimum cost homomorphisms to semicomplete multipartite digraphs.

Gregory Z. Gutin Arash Rafiey Anders Yeo

Published in: Discret. Appl. Math. (2008)

Keyphrases

minimum cost
undirected graph
np hard
approximation algorithms
network flow
network flow problem
equivalence classes
spanning tree
directed graph
capacity constraints
network simplex algorithm
special case
minimum cost flow