Given a number of sets, what is the best algorithm to calculate the smallest set S such that S is not disjoint with any of the given sets?
1
$\begingroup$
$\endgroup$
-
1$\begingroup$ en.wikipedia.org/wiki/Set_cover_problem#Hitting_set_formulation $\endgroup$ – user12859 May 27 '17 at 5:36
-
$\begingroup$ @RickyDemer Make an answer? $\endgroup$ – Yuval Filmus May 27 '17 at 8:34
