Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs.

Arvind Gupta Mehdi Karimi Eun Jung Kim Arash Rafiey

Published in: COCOA (2008)

Keyphrases

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