Maximum bipartite matchings with low rank data

Theoretical Computer Science, pp. 82-91, 2016.

Cited by: 1|Bibtex|Views7|

Abstract:

The maximum-weighted bipartite matching problem between two sets U = V = 1 : n is defined by a matrix W = ( w i j ) n × n of data. Its goal is to find a permutation π over 1 : n whose total weight ? i w i , π ( i ) is maximized. In various practical applications,3 the affinity data may be of low rank (or approximately low rank): we say W...More

Code:

Data:

Your rating :
0

 

Tags
Comments