hw5 - CS 573 Graduate Algorithms Fall 2011 HW 5(due in...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS 573: Graduate Algorithms, Fall 2011 HW 5 (due in class on Tuesday, November 29th) This homework contains five problems. Read the instructions for submitting homework on the course web page . In particular, make sure that you write the solutions for the problems on separate sheets of paper. Write your name and netid on each sheet. Collaboration Policy: For this home work students can work in groups of up to three students each. Only one copy of the homework is to be submitted for each group. Make sure to list all the names/netids clearly on each page. Note on Proofs: Details are important in proofs but so is conciseness. Striking a good balance between them is a skill that is very useful to develop, especially at the graduate level. 1. (20 pts) Consider the following scheduling problem. There are n unit-sized jobs that need to be scheduled on m identical machines. Each job j has a release time r j and a deadline d j both of which are integers. A schedule assigns each job to a time slot [ t,t + 1] for some integer t and to some machine such that no two jobs are assigned to the same slot on the same machine. If job j is completed by its deadline there is no penalty; if it completes at time C j > d j then it incurs a penalty of ( C j- d j ). A job cannot be schedule before it is release time. The goal is find a schedule for the jobs on the given machines so as to minimize the total penalty. Describe a polynomial time algorithm for this problem. Be sure to pay attention to the fact that your algorithm runs in polynomial time by examining carefully the size of the input. 2. (20 pts) Reduce the following two problems to the problem of computing a minimum-cost perfect matching in a bipartite graph. • Given an undirected graph G = ( V,E ) and edge costs c : E → R find the minimum-cost 2-matching in G . A 2-matching in G is an assignment x : E → Z + such that x ( δ ( v )) = 2 for each v ....
View Full Document

This note was uploaded on 01/22/2012 for the course CS 573 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.

Page1 / 3

hw5 - CS 573 Graduate Algorithms Fall 2011 HW 5(due in...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online