Set Cover

In the Set Cover problem we need to cover

• cover edges of the graph

• elements of a set, S

• cover elements in U

• None of these

The Set covering problem aims to find the _______ no of sets...

which of the following option is true about U = { 6,7,8,9,10} and s1={ 8,6} s2 ={7,9,10} s3= { 9,6,10}

1) s1 U s2 = U

2) s2 U s3 = U

3) s1 U s3 not equal to U

4) s1 U s2 U s3 not equal to U

• 1 and 2

• 1 , 2 and 3

• 1 and 3

• 2 and 4

Which is the minimum set cover for the cost of s1 = 5 , s2 = 8 and s3 = 11 ?

• { s1 , s3 }

• { s2 , s3 }

• { s1 , s2 }

• none of these

Suppose s1= 5 , s2 = 10 , s3= 3 . Find which is having the maximum set cover?

• {s1,s2,s3}

• {s1,s2}

• {s1,s3}

• {s2,s3}