1
$\begingroup$

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?

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.