Maximum rank matrix completion Original Research Article

The maximum rank completion problem is the problem of, given a partial matrix (that is, a matrix where we are only given some of the entries), filling in the unknown entries in such a way as to maximize the rank. Applications include bipartite matching and matroid intersection for linearly represented matroids. We describe an algorithm that finds a maximum rank completion by perturbing an arbitrary completion in a greedy way.