CS600 Algorithms and Data Structures

CS600 Algorithms and Data Structures -- Lecture 11

Last update October 2, 2003

Topics References

1. Reduction Tree of NP-Complete Problems

Clique, Graph Color, 3D Matching, Partition,

Vertex Cover, Bin Packing, Knapsack, Job Scheduling

2. Proof of NP-Completeness

Committee Meetings Scheduling

Back to Lectures Home Page

Back to CS600 Home Page

Back to Toida's Home Page

Topics	References

1. Reduction Tree of NP-Complete Problems
Clique, Graph Color, 3D Matching, Partition,
Vertex Cover, Bin Packing, Knapsack, Job Scheduling
2. Proof of NP-Completeness
Committee Meetings Scheduling