45 citations · 127 across the 24 of their papers we have counts for
1 paper · 1 filter
Megha Khosla, Avishek Anand
We study the classical weighted perfect matchings problem for bipartite graphs or sometimes referred to as the assignment problem, i.e., given a weighted bipartite graph $G = (U\cu…