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

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

View Full Document Right Arrow Icon
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
Background image of page 1
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

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.

Ask a homework question - tutors are online