Login / Signup
Minimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs.
Arvind Gupta
Gregory Z. Gutin
Mehdi Karimi
Eun Jung Kim
Arash Rafiey
Published in:
Australas. J Comb. (2010)
Keyphrases
</>
minimum cost
undirected graph
np hard
approximation algorithms
equivalence classes
spanning tree
network flow
directed graph
capacity constraints
network simplex algorithm
network flow problem
integer programming
multistage
transitive closure
minimum cost flow
minimum cost path