{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

F2009HW5

# F2009HW5 - ECE264 Fall 2009 Homework 5 Due Fri December 4...

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

ECE264 Fall 2009 Homework 5 Due Fri, December 4, 11:59pm Given a Boolean matrix (a matrix containing only 0,1 values), column j is said to cover row i if the entry in row i, column j of the matrix is 1. For example, the following is a Boolean matrix where column 0 covers row 1, column 1 covers row 2, column 2 covers rows 0 and 1, and column 3 covers rows 1 and 2. 0 1 2 3 0 0 0 1 0 1 1 0 1 1 2 0 1 0 1 The Boolean covering problem is the following: Given a Boolean matrix, find the smallest number of columns that cover all the rows. In the example, selecting columns 1 and 2 (or 2 and 3) will cover all the rows. In a solution vector to the problem, a 1 in position j indicates that column j is included in the solution, and a 0 in position j indicates that column j is not included in the solution. For example, the solution where columns 1 and 2 are selected is described by the vector 0 1 1 0. The following algorithm was written for solving the problem.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 2

F2009HW5 - ECE264 Fall 2009 Homework 5 Due Fri December 4...

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

View Full Document
Ask a homework question - tutors are online