All Questions
1
question
0
votes
1
answer
175
views
Prove NP-Complete. $n$ clubs, largest has $m$ members. Hall Capacity is of $k$ guests. List $k$ students s. t. every club has atleast one member.
Question
Prove that this Problem is $\mathbb{NP-Complete}$ given that that the problem SATISFIABILITY is $\mathbb{NP-Complete}$.
A University has $n$ clubs, the largest of which contains $m$ members (...
- 171