hbs11(1) - 2 A boolean formula is in disjunctive normal...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 473 HBS 11 Spring 2009 CS 473: Undergraduate Algorithms, Spring 2009 HBS 11 1. You step in a party with a camera in your hand. Each person attending the party has some friends there. You want to have exactly one picture of each person in your camera. You want to use the following protocol to collect photos. At each step, the person that has the camera in his hand takes a picture of one of his / her friends and pass the camera to him / her. Of course, you only like the solution if it finishes when the camera is in your hand. Given the friendship matrix of the people in the party, design a polynomial algorithm that decides whether this is possible, or prove that this decision problem is NP-hard.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2. A boolean formula is in disjunctive normal form (DNF) if it is a disjunctions (OR) of several clauses, each of which is the conjunction (AND) of several literals, each of which is either a variable or its negation. For example: ( a ∧ b ∧ c ) ∨ ( ¯ a ∧ b ) ∨ ( ¯ c ∧ x ) Given a DNF formula give a polynomial algorithm to check whether it is satisfiable or not. Why this does not imply P = N P . 3. Prove that the following problems are NP-complete. (a) Given an undirected graph G , does G have a spanning tree in which every node has degree at most 17? (b) Given an undirected graph G , does G have a spanning tree with at most 42 leaves? 1...
View Full Document

This note was uploaded on 01/22/2012 for the course CS 573 taught by Professor Chekuri,c during the Fall '08 term at University of Illinois, Urbana Champaign.

Ask a homework question - tutors are online