Problem On Sets

Revision en3, by Tameshk, 2020-07-15 00:21:29

Consider 16 non-empty sets each containing up to 2^16 numbers, which are between 0 to 2^16-1 inclusive and each number may appear in more than one sets, obviously. The goal is to find minimum number of numbers which we have at least one number from each set. I tried greedy approach, clearly is wrong, also have found general form of this problem which is np-complete. link

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English Tameshk 2020-07-15 00:24:27 43 Tiny change: 'problem)\n \n' -> 'problem)\nAny comments would be highly appreciated.\n \n'
en3 English Tameshk 2020-07-15 00:21:29 4 Tiny change: 'ch contains up to 2^1' -> 'ch containing up to 2^1'
en2 English Tameshk 2020-07-15 00:20:36 13 Tiny change: 'm of this question which is ' -> 'm of this problem which is '
en1 English Tameshk 2020-07-15 00:19:55 447 Initial revision (published)