Question: (Hitting set) Given a collection C = (S1, S2,..., Sn) of sub- sets of U let HCU be called a hitting set if HS;

(Hitting set) Given a collection C = (S1, S2,..., Sn) of sub-

(Hitting set) Given a collection C = (S1, S2,..., Sn) of sub- sets of U let HCU be called a hitting set if HS; is non-empty for each Si, 1 i n. Show that the problem of deciding whether C has a hitting set of given size k is NP-Complete. You may assume that SAT, 3CNFSAT, k-Clique, k-Vertex Cover, k-IND, HAMILTONCYCLE are NP-Complete.

Step by Step Solution

★★★★★

3.52 Rating (159 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock

The detailed ... View full answer

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Computer Engineering Questions!

Let = {0,1}. Show that the problem of determining whether a CFG generates some string in 1 is decidable. In other words, show that {G| G is a CFG over {0,1} and 1 * L(G) } is a decidable language.

Show that the problem SAT, which takes an arbitrary Boolean formula S as input and asks whether S is satisfiable, is NP-complete.

Given a collection C of n cost-performance pairs (c, p), describe an algorithm for finding the maxima pairs of C in O(nlogn) time.

GREEDY ALGORITHM PROBLEM: Given subsets S1, S2, , Sn of a set S of points and an integer m, a maximum mcover is a collection of m of the subsets that covers the maximum number of points of S. Give a...

If {S1, S2, . . . , Sn} is a collection of convex subsets of a linear space X, their sum S1 + S2 +...........+ Sn is also a convex set.

Let {S1, S2, . . . , Sn} be a collection of nonempty compact subsets of an m-dimensional linear space, and let x conv We consider the Cartesian product of the convex hulls of Si, namely Every point...

Question 3: JAVA PROGRAMMING Maximum 5 marks in total for question part Maximum 3 marks for algorithm Description (max 3) - set variable called HighestScore to zero and variable called BestName to...

6.Consider the following Binary Search Tree 10 / \ 5 20 / / \ 4 15 30 / 11 If we randomly search one of the keys present in above BST, what would be the expected number of comparisons? Note that you...

I need complete solution for this and also it asks to shiw polynomial time algorithm so please provide me everything Problem Suppose we want to replicate a file over a collection of n servers,...

Consider the descriptions of the following problems: 1. Problem P_1: Given a set S of positive integers {s_1, s_2, ..., s_n} and an integer C as input, is there a subset T of S such that the integers...

At the end of 2010, Majors Furniture Company failed to accrue $61,000 of interest expense that accrued during the last five months of 2010 on bonds payable. The bonds mature in 2024. The discount on...

The following data pertain to British Isles Aggregates Company, a producer of sand, gravel, and cement, for the year just ended. Sales revenue ......... 2,000,000 Cost of goods sold ............

Two cities are 2 0 0 0 km apart and lie on the same north - south line. The lathude of the northermost city is 2 0 N . What is the latide of the other city? The radius of the Earth is approximately 6...

Modern robotic manipulators that act directly upon their target environments must be controlled so that impact forces as well as steady-state forces do not damage the targets. At the same time, the...

The unity feedback system of Figure P7.1, where is to have 1/6000 error between an input of 10tu(t) and the output in the steady state. a. Find K and n to meet the specification. b. What are K p , K...

The 30-kg spool of outer radius r o = 450 mm has a centroidal radius of gyration k = 275 mm and a central shaft of radius r i = 200 mm. The spool is at rest on the incline when a tension T = 300 N is...

Refer to Exercises 11 and 13. Suppose that the sample proportion of students who did all their assigned homework last week is p = 57/100 = 0.57. Would this sample proportion provide convincing...

SELECT c.state, p.vehicle_maker, COUNT(DISTINCT o.customer_id) AS customer_count, RANK() OVER (PARTITION BY c.state ORDER BY COUNT(DISTINCT o.customer_id) DESC) AS rank_pos FROM customer_t c,...

9-13. [5] Prove that the following problem is NP-complete: Problem: Hitting Set Input: A collection C of subsets of a set S, positive integer k. Output: Does S contain a subset S' such that |S'| S k...

[C Program] 5 Reductions and Boolean Satisfiability II (Hitting Set)) In this question, we consider the litting Set problem defined as follows: Given a collection of subsets of a finite set S, and a...

Hitting Set problem: Given a collection F subsets of universe U and a number k , the hitting set problem is to find the subset SsubeU that has at most k elements which intersects ( hits ) every set...

Consider an instance of the Satisfiability Problem, specified by clauses Q over a set of Boolean variables x 1 , dots, x n . We say that the instance is monotone if each term in each clause consists...

1. Answer the following questions about the the Floyd-Warshall algorithm: (a) (10 points) The algorithm currently computes n + 1 matrices D(0), D(1), ..., D(n) . Modify the algorithm so that it...

Problem 4: HITTING SET problem is defined as follows: Given a set of elements S, a family of sets C- S1, S2, SnJ, and an integer b, is there a set H with b or fewer elements such that H intersects...