This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Homework 3 CSE 450/598 Spring 2010 Arizona State University Due: Thursday 2/11 before 10:30 1. (4.2) For each of the following statements, decide whether it is true or false. If it is true, give a short explanation. If it is false, give a counterexample. (a) Suppose we are given an instance of the Minimum Spanning Tree problem on a graph G , with edge costs that are all positive and distinct. Let T be a minimum spanning tree for this instance. Now suppose we replace each edge cost c e by its square c 2 e , thereby creating a new instance of the problem with the same graph but different costs. True or false? T must still be a minimum spanning tree for this new instance. (b) Suppose we are given an instance of the Shortest s t Path problem on a directed graph G . We assume that all edge costs are positive and distinct. Let P be a minimumcost s t path for this instance. Now suppose we replace each edge cost c e by its square c 2 e , thereby creating a new instance of the problem with the same graph but different costs. True or false? P must still be a minimumcost s t path for this new instance. 2. (4.13) A small business—say, a photocopying service with a single large machine— faces the following scheduling problem. Each morning they get a set of jobs from customers. They want to do the jobs on their single machine in an order that keeps their customers happiest....
View
Full Document
 Spring '08
 
 Harry Potter universe

Click to edit the document details