Consider the bin-packing problem:
Input:
Show that Bin Packing is NP-complete.
Consider the following problem, called BOX-DEPTH: Given a set of
Describe a polynomial-time reduction from BOX-DEPTH to MAXCLIQUE.
Describe and analyze a polynomial-time algorithm for BOX-DEPTH. [Hint:
Why don’t these two results imply that