Minimum cost and list homomorphisms to semicomplete digraphs.

Gregory Z. Gutin Arash Rafiey Anders Yeo

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

Keyphrases

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