1. Lecture 26 More examples

2. Integer Programming
Knapsack
TSP
Partition VC HC
3DM
Subsum
Planar 3SAT
3SAT
SAT

3. Planar 3SAT

4. Planar CNF (type1)

5. Planar CNF (type 2)

6. A planar (type2) CNF must be a planar (type 1) CNF!!!

7. 2-3CNF

8. Planar 2-3SAT (type1)

9. Planar 2-3SAT (type2)

10. Planar 3SAT

11. Want to show

21. Reduction and Finding a Reduction

22. Reduction Problem A Problem B construct inputs inputs such that
outputs
outputs
yes
yes no no

23. Find a Reduction Problem A Problem B construct inputs inputs find
outputs
outputs
yes
yes no no

24. Subgraph Isomorphism

25. Hamiltonian Path

26. Min Dominating Set

27. Min CDS

28. Spanning with Min # of Leaves

29. Spanning with Max # of Leaves

30. Puzzle
Answer

32. CS6382
CS7301-CS6301