This preview shows page 1. Sign up to view the full content.
Unformatted text preview: m is the number of edges). Problem 2. The Rectangle Packing Problem RPP is given a set of n small rectangles of sizes a i b i (where 1 i n ) and a large A B rectangle, can the large rectangle be packed with a subset of the small rectangles so that there is no empty space? Assume all values are integers. Show that RPP is in NP ....
View
Full
Document
This note was uploaded on 01/13/2012 for the course CMSC 351 taught by Professor Staff during the Fall '11 term at University of Louisville.
 Fall '11
 Staff

Click to edit the document details