Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs.
Gregory Z. GutinArash RafieyAnders YeoPublished in: SIAM J. Discret. Math. (2008)
Keyphrases
- minimum cost
- undirected graph
- spanning tree
- approximation algorithms
- np hard
- network flow
- capacity constraints
- network flow problem
- network simplex algorithm
- bipartite graph
- minimum cost flow
- equivalence classes
- special case
- random graphs
- directed graph
- graph model
- integer programming
- traveling salesman problem
- linear programming
- scheduling problem
- lower bound