code_overlord's blog

Variation of set cover problem
By code_overlord, 9 years ago, In English

I need some help with a problem.

You are given a set S and a list L of subsets of S. L need not contain all subsets of S. Is it possible to pick some subsets from L such that they are pairwise disjoint and their union is S?

Note: It is not important to find those subsets. What is important is to be able to determine whether it is possible or not.

  • Vote: I like it
  • -11
  • Vote: I do not like it

»
9 years ago, # |
  Vote: I like it +6 Vote: I do not like it

http://en.wikipedia.org/wiki/Exact_cover

→ Reply
»
9 years ago, # |
← Rev. 3   Vote: I like it +3 Vote: I do not like it

This is related to a problem from the December Long Challenge.

→ Reply