This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Packing? (Bad events - make none of them happen) Sequencing? Ind. Set in Max. Degree-3 Graphs From 3SAT to I-Set. Variable Gadgets Clause gadgets Variable gadgets labeled x1, x ̅ 1, x2, x ̅ 2, x3, x ̅ 3 Create a graph where every vertex in every clause gadget has degree 3. a vertex in a variable gadget can have high degree if connected to many clauses. Improve reduction so that we can create an ind. set instance with degree 3 Can we modify the variable gadgets so when everything hooked up we are in a graph of max. degree-3 k = half of each var. gadget and one extra vtx from each clause gadget 3-DIM MATCHING (Sec. 8.6??) Given 3 sets X, Y, Z each with n elements 29-2 Given m sets S 1 , . .., S m each containing exactly one X, one Y, one Z. Output “yes” if there is a subcollection S i1 , S i2 , . .., S in covering each element of the X ∪ Y ∪ Z exactly once. 29-3...
View Full Document
This note was uploaded on 10/02/2008 for the course CS 482 taught by Professor Kleinberg during the Spring '08 term at Cornell.
- Spring '08