Lecture 04-12-17

Discuss Homework 6

1. Certificate
2. Hamilton path
3. “Universal vertex”
4. Half-clique

“Solve the knapsack problem”

• Pseudo-polynomial algorithm
  • Polynomial in the size of the input and the maximum size

Test

• Approximation algorithm
• NP complete-ness
• No sorting
• 1 problem on dynamic programming
• 3 NP-complete
  • 1 is reduction
  • 1 is understanding P / NP / NPC
  • 1 is NPC