Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

Min weight perfect matching on complete bipartite graph?

Revision en1, by skavurskaa, 2016-10-13 19:50:35

Problem statement: Given a complete bipartite graph KN, N with weights Wuv assigned to each edge uv, find a perfect matching with minimal sum of edge weights among all perfect matchings.

Is there any easy to code polynomial algorithm for this problem? I know an easy way to solve it using subset dp in O(N22N), and i also think that it is possible to modify the Hungarian Algorithm to solve this problem. But is there any easier algorithm considering it is always a complete bipartite graph? I don't care too much about the time complexity as long as it is polynomial.

Thanks in advance!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English skavurskaa 2016-10-13 19:50:35 667 Initial revision (published)