New answers tagged

1 vote

Covering a graph with M cliques maximizing total edges weight

One approach is to solve this with tools from operations research and combinatorial optimization, and specifically, to view this as an instance of ILP or SAT. Let $x_{c,i}$ be a variable that will be ...
D.W.'s user avatar
  • 158k
1 vote

Finding all stable matchings in stable marriage problem

I worked with OP on this problem. This is what we found. The problem solved by Gusfield in the paper "Three Fast Algorithms for Four Problems in Stable Marriage" does indeed include a ...
StefanoTrv's user avatar

Top 50 recent answers are included