This preview shows page 1. Sign up to view the full content.
Unformatted text preview: CMPT 405/705 — Design and Analysis of Algorithms Exercises on NP-Completeness. Due: Thursday, November 12th (at the beginning of the class) Reminder: the work you submit must be your own. Any collaboration and consulting outside resources must be explicitly mentioned on your submission. 1. A store trying to analyze the behavior of its customers will often maintain a 2-dimensional array A , where the rows correspond to its customers and the columns correspond to products it sells. The entry A [ i,j ] specifies the quantity of product j that has been purchased by customer i . One thing that a store might want to do with this data is the following. Let us say that a subset S of the customers is diverse if no two of the customers in S have ever bought the same product (i.e., for each product, at most one of the customers in S has ever bought it). A diverse set of customers can be useful, for example, as a target pool for market research....
View Full Document
This note was uploaded on 11/11/2009 for the course CS 405/705 taught by Professor Bulatov during the Fall '09 term at Simon Fraser.
- Fall '09