1 citations · 1 across the 1 of their papers we have counts for
1 paper · 1 filter
Justin Salez, Devavrat Shah
The random assignment problem asks for the minimum-cost perfect matching in the complete n×n bipartite graph $\Knn$ with i.i.d. edge weights, say uniform on [0,1]. In a r…