Computer Science 341 - Applied Algorithms

We will look at recent advances in the design and analysis of data structures and algorithms, with an emphasis on real-world applications.  Topics to be covered include approximation algorithms and heuristics for NP-hard problems; combinatorial optimization; new analysis techniques; and methods of algorithm engineering and experimental analysis of algorithms.  The specific problem domains to be studied will vary from year to year, to reflect the state of the art in algorithm research.  Students will read and present research papers and carry out small research projects to evaluate algorithm performance in realistic scenarios.

Requisite: COSC 201. Fall semester. Professor C. McGeoch.