Homework 8

Homework 8 - CS180 Winter 2011 Homework 8 Due: 9th March...

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

View Full Document Right Arrow Icon
CS180 Winter 2011 Homework 8 Due: 9 th March When submitting your homework, please include your name at the top of each page. If you submit multiple pages, please staple them together . We also ask that you do something to indicate which name is your last name on the first page, such as underlining it. Please submit your solutions with the problems solved in the order they are given. 1. Consider a set A = { a 1 ,...,a n } and a collection B 1 ,B 2 ,...B m of subsets of A (i.e., B i A for each i ) We say that a set H A is a hitting set for the collection B 1 ,B 2 ,...B m if H contains at least one element from each B i – that is, if H B i is not empty for each i . We now define the Hitting Set Problem 1 as follows. We are given a set A and a collection B of subsets of A , and a number k . We are asked: is there a hitting set H A for B so that the size of H is at most k ? Prove that
Background image of page 1

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

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

This note was uploaded on 04/16/2011 for the course CS 180 taught by Professor Moloudi during the Spring '08 term at UCLA.

Page1 / 2

Homework 8 - CS180 Winter 2011 Homework 8 Due: 9th March...

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