COMP 4615

(3 Credits) 3 Lecture hours 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.