CSCI 8470 Advanced Algorithms

CSCI 8470 is a course stepped up from CSCI 6470 Algorithms. Therefore the completion of 6470 (or an equivalent course approval from the instructor) is required for taking 8470.

Content:

This course studies the complexity landscape beyond the NP-completeness theory and investigates algorithmic approaches to coping with computational intractability. Content is organized into three components:
1. Algorithms to cope with intractability, including approximation algorithms, randomized algorithms, and parameterized exact algorithms;
2. Algorithmic structural graph theory with a brief introduction to graph minor theorems and detailed discussions on the notion of tree-width and graph decomposition techniques; and
3. Applications of advanced graph theory to solving emerging problems of interest, e.g., in learning of and inference with graphical models in machine learning.

Format:

Combination of lectures, classrooms discussions, presentations, and research reports.

Grading:

• 1/3 for classroom participation: attendance, posing and answering questions
• 1/3 for literature review, presentation, and leading discussions
• 1/3 for research project, written report, and presentation