Skip to main content
Share Your Experience: Take the 2024 Developer Survey

New answers tagged

3 votes
Accepted

Finding a matching with a specific weight

It is not hard to see, that the problem is weakly-NP hard by using a reduction to SUBSET-SUM: Given an instance $p_1, p_2, ... p_n$ and a target sum $T$ and construct a bipartite graph consisting of ...
SimonNW's user avatar
  • 131

Top 50 recent answers are included