1
$\begingroup$

Given:

  • A set of available customers $c_1, c_2, \dots, c_n$.
  • A set of available foods $f_1, f_2, \dots, f_m$.
  • Each customer will choose a subset of the available food.

Problem:

  • Find the maximum number of customers that can be chosen, such that no two customers share the same food.

Question:

  • How to reduce the independent set problem to this problem, in order to prove that this is an NP-Complete problem ?
|cite|improve this question
$\endgroup$
  • 2
    $\begingroup$ What have you tried? Where did you get stuck? $\endgroup$ – dkaeae Dec 6 '18 at 14:02
0
$\begingroup$

Hint: try to reduce each vertex to a customer and each edge to an available food.

|cite|improve this answer
$\endgroup$

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Not the answer you're looking for? Browse other questions tagged or ask your own question.