CSC 612 Analysis of Algorithms
An advanced study in computer algorithms that delves deeply into a selected problem: linear programming (simplex, revised simplex, complementary slackness, Khachian's ellipsoid, etc) and duality; in addition, the course also covers suffix trees, minimum spanning trees, Bellman-Ford and Dijkstra's shortest paths algorithms, and computational geometry.
Prerequisites: CSC 311 or Permission of Instructor.