CS 473HBS 8Spring 2009CS 473: Undergraduate Algorithms, Spring 2009HBS 81.A boxican be specified by the values of its sides, say(i1,i2,i3). We know all the side lengthsare larger than 10 and smaller than 20 (i.e. 10<i1,i2,i3<20). Geometrically, you know whatit means for one box to nest in another: It is possible if you can rotate the smaller so that it fitsinside the larger in each dimension. Of course, nesting is recursive, that is ifinests injandjnests inktheninests ink. After doing some nesting operations, we say a box is visible if it is notnested in any other one. Given a set of boxes (each specified by the lengthes of their sides) thegoal is to find a set of nesting operations to minimize the number of visible boxes. Design andanalyze an efficient algorithm to do this.2.Let the number of papers submitted to a conference benand the number of available reviewers bem. Each reviewer has a list of papers that he/she can review and each paper should be reviewedby three different persons. Also, each reviewer can review at most 5 papers. Design and analyze
This is the end of the preview.
access the rest of the document.