CPSC
Exercises 11 - CPSC 413 F18.pdf

# Well connected vertex cover input a graph g v e on n

• 3

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

Well-Connected Vertex Cover Input: a graph G = ( V, E ) on n = | V | vertices an integer k Output: “Yes” if G has a well-connected vertex cover of size (at most) k . “No” otherwise. 1. Show that Vertex Cover 6 m P Well-Connected Vertex Cover . 4. Recruitment problem See Exercise 3 on page 505 in Chapter 8 in which the problem Recruitment is being defined. Show that Vertex Cover 6 m P Recruitment .

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

5. Reduction to 3SAT Consider the following decision problem SillyPrb , which is to determine if an array contains an integer that is bigger than t . Silly Prb Input: an array A = ( a 1 , . . . , a n ) of n integers. an integer t > 0. Output: “Yes” if there exists an index 1 i n such that A [ i ] > t “No” otherwise. 1. Show that Silly Prb 6 m P 3SAT . ( Hint: This is not obvious. Double-check your proof.) 2. Discuss the implications of this statement. 6. SAT and 3SAT Consider SAT , defined as 3SAT , except that there are no constraints on the number of literals in each clause. Each clause contains one or more distinct literals. Show that SAT 6 m P 3SAT . ( Hint: Generalize the reduction of 4SAT 6 m P 3SAT .) 7. Set Cover Let U = { u 1 , u 2 , . . . , u n } be a set. Consider we are given a collection of subsets S 1 , S 2 , . . . , S m of U . That is, S i U for each 1 i m of the m subsets. We want to choose some of those m subsets so that the union of the chosen subsets is U .
This is the end of the preview. Sign up to access the rest of the document.
• Fall '13
• GeoffCruttwell
• Graph Theory, NP-complete problems

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern