COMP 4615 - Algorithms II

Credit(s): 3
Lecture Hour(s): 3
Lecture Hours Schedule Type: Lecture
This course explores advanced algorithmic techniques for solving complex optimization problems. Topics include modeling and solving problems using flow networks, designing and analyzing approximation algorithms for NP-hard combinatorial problems, leveraging randomization for efficient algorithm design, and understanding the principles and performance bounds of online algorithms.

Prerequisite(s): COMP 3614 with a minimum grade of C-