Chapter 13 NP-Completeness.ppt

Show ?(x in S) cx ? H(|S|)(Formally) Consider each Si in the order it is added to C. Let ui = number of elements needing to be covered after Si has been selected ui =|(S – (S1 + S2 + ... Si))| Thus ui-1 –ui elements are covered for the first time by Si. NP-Completeness * ?(x in S) cx =? (ui-1 –ui) 1/|(Si – (S1 + S2 + ... Si-1))| but |(Si – (S1 + S2 + ... Si-1))|?|(S – (S1 + S2 + ... Si-1))| = ui-1 ?(x in S) cx ? ?(i=1..k) (ui-1 –ui) 1/ui-1 but we can rewrite a product as a sum for example 4z = ?(i=1..4) z (z is constant with respect to i) Thus (ui-1 –ui) 1/ui-1 = ?(j=ui+1,ui-1) 1/ui-1 (remember ui ui-1) so ?(i=1..k) (ui-1 –ui) 1/ui-1 =?(i=1..k) ?(j=ui+1,ui-1) 1/ui-1 ? ?(i=1..k) ?(j=ui+1,ui-1)1/j as j ? ui-1 NP-Completeness * NP-Completeness * ?(i=1..k) ?(j=ui+1,ui-1)1/j = ?(i=1..k) (?(j=1,ui-1)1/j - ?(j=1,ui))1/j) = ?(i=1..k) H(ui-1 ) – H(ui) = H(u0) – H(uk) (because sum telescopes) but u0 = |S| and uk =0 = H(|S|) (which is what we wanted to prove) Graphs * * Vertex-Cover is NP-complete NP-Completeness * A vertex cover of graph G=(V,E) is a subset W of V, such that, for every edge (a,b) in E, a is in W or b is in W. We say every edge is “covered” by the set. Reduce 3SAT to VERTEX-COVER – DISSIMILAR PROBLEMS? Pretty complicated mapping. Let S be a Boolean formula in CNF with each clause having 3 literals. For each variable x, create nodes for x and ?x, and connect these two. For each clause (x+ ? y+z), create a triangle with a node representing each term of the clause and connect these three nodes. The fact that they are connected indicated they are from the same clause. x ?x t2 t3 t1 NP-Completeness * Completing the construction Connect each literal in a clause triangle to its copy in a variable pair. Example: a clause (?x+y+z) Let n=# of variables Let m=# of clauses Set K=n+2m at least two nodes of every triangle will be needed in the cover at least one of every true/false will be needed in the cover If hope to achieve K,