{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# hwk10 - m is the number of edges Problem 2 The Rectangle...

This preview shows page 1. Sign up to view the full content.

Fall 2011 CMSC 351: Homework 10 Clyde Kruskal Due at the start of class Wednesday, November 30, 2011. Problem 1. Assume that G = ( V,E ) is a weighted graph where each edge has nonnegative integer weight. Let c be the maximum weight of any edge in the graph. Show how to modify dijkstra’s algorithm to solve the single source shortest paths problem in time O ( m + nc ) (where n is the number of vertices and
This is the end of the preview. Sign up to access the rest of the document.

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

{[ snackBarMessage ]}

Ask a homework question - tutors are online