I'm attempting to prove a problem is NPc, but I'm not sure which one would be optimal to use,The problem is: There are $n$ boars to be caged, and $m$ cages which each cage being able to hold $k$ boars.Any boar can be put in in any cage, but certain pairs of boars can't be put together in the same cage.I'm thinking of SAT or Knapsack to reduce to this problem, but not sure which. If anyone can lead me to the right direction or get me started I'd really appreciate it, thanks
Not sure which NPc problem to use for NPc reduction problem,
complexity theory;np complete