CS600 Algorithms and Data Structures

CS600 Algorithms and Data Structures -- Lecture 6


Last update October 2, 2002





Topics References
1. Proof of NP-Completeness Textbook 34.4
    Clique, Vertex Cover
    Job Scheduling -- Example and NP-completeness
2. Linear Programming --- Introduction with Examples Textbook Chapter 29, pp. 770 - 772







Back to Lectures Home Page
Back to CS600 Home Page
Back to Toida's Home Page