On the approximation of minimum cost homomorphism to bipartite graphs.
Monaldo MastrolilliArash RafieyPublished in: Discret. Appl. Math. (2013)
Keyphrases
- minimum cost
- bipartite graph
- approximation algorithms
- approximation ratio
- np hard
- network flow
- spanning tree
- special case
- maximum matching
- network flow problem
- capacity constraints
- network simplex algorithm
- minimum weight
- worst case
- link prediction
- minimum cost flow
- network design problem
- maximum cardinality
- undirected graph
- edit operations
- np complete
- linear programming
- maximum weight
- integrality gap
- bipartite graph matching
- search space