The minimum cost perfect matching problem with conflict pair constraints.

Temel Öncan Ruonan Zhang Abraham P. Punnen

Published in: Comput. Oper. Res. (2013)

Keyphrases

minimum cost
capacity constraints
np hard
network flow problem
linear relaxation
approximation algorithms
network flow
spanning tree
network simplex algorithm
edit operations
approximate matching
matching algorithm
undirected graph
minimum cost flow
graph matching
np complete
special case
similarity measure