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
 Fall '11
 Staff
 Natural number, Clyde Kruskal, Rectangle Packing Problem

Click to edit the document details