Consistent Structured Estimation for Weighted Bipartite Matching thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Consistent Structured Estimation for Weighted Bipartite Matching

Published on Dec 20, 20085709 Views

Given a weighted bipartite graph, the assignment problem consists of finding the heaviest perfect match. This is a classical problem in combinatorial optimization, which is solvable exactly and effici

Related categories