This approach still runs for several hours on large problem instances due to the expensive calculation of SCORE (lines 11-12), making more complete local searches, using best-first or beam search, impractical.
we obtain a relation S that partitions M into a set of sets C = {C 1 , .