CSE 589 Part V
Reading
Easy vs. Hard Problems
Hardest problems in NP are NP-complete
Most notorious hard graph problem
Essence of NP-completeness
Polynomial Time Reductions
Definitions, etc.
Proving a Problem is NP-complete
Remarkable Theorem of Steve Cook (1971) Proved that there exist NP-complete problems
Idea of Proof
Some NP-complete Problems
Satisfiability
Traveling Salesman Problem
Clique
Vertex Coloring
Independent Set
Hamiltonian Cycle
Graph Partition
Steiner Tree
Integer Linear Programming
How you prove a problem Q is NP-complete.
Remember
Let’s do some NP-completeness proofs
Let’s show the following problems are NP-complete
PPT Slide
Comments on NP-completeness proofs
Comments cont.
Email: karlin@cs.washington.edu
Home Page: http://www.cs.washington.edu/education/courses/589
Download presentation source