C S 604 - Advanced Algorithms

Advanced topics in the design and analysis of algorithms are explored. These topics include the theory of NP-completeness, NP-hard optimization problems, polynomialtime approximation algorithms, approximation schemes, approximability and nonapproximability results, randomized algorithms, and parallel algorithms.

Prerequisites
Prereq: 504 or 506.

Credits: (4)
Instructors
Juedes.

Ohio University

Ohio University

C S 604 - Advanced Algorithms