CSCI 8470 Advanced Algorithms (Spring 2016)
Instructor : Liming Cai
Office: 544 Boyd
Phone : 2-6081
Email : cai@cs.uga.edu
Schedule: : 11:15-12:05 (Mon, Room 430 Aderhold) and 11:00-12:15 (Tue/Thu, Room 238 Pharmacy)
Office Hours: 1:00-2:00 Mon/Thu or by appointment
Course contents:
This course investigates advanced methods,
techniques, and theories for algorithm analysis and design, especially in coping with the computational intractability of problems in
graph, string, geometric, and operations research problems.
Topics include the landscape of NP-completeness theory and beyond, exact algorithms, parameterized algorithms, algorithmic graph theory, and introduction to approximation algorithm, randomized algorithms, and derandomization techniques.
Prerequisites:
CSCI 6470/4470 Algorithms or
CSCI 6610 Automata and Formal Languages, or approval of the department.
Or approval of the department.
References:
- Computers and Intractability: A Guide to the Theory of NP-completeness,
M. R. Garey and D. S. Johnson, Freeman Publishing, 1979.
- Introduction to Algorithms, T. H. Cormen, C. E. Leiserson,
R. L. Rivest, and C. Stein, 2nd ed,
McGraw-Hill, 2001.
- Parameterized Complexity, Downey, Rod G. and Fellows, M.R.
Springer, 1997.
- Approximation Algorithms for NP-Hard Problems, Hochbaum, D.
(ed.) PWS, 1997
- Randomized Algorithms, Motwani, R. and Raghavan P., Cambridge University
Press, 1995.
- Research papers
Grading policy:
Leading discussions on at least one research paper: 30%
Homework assignments, research projects: 50%
Final exam: 20%
Tentative schedule:
Part I. Landscape of NP-completeness and beyond (4 week)
Part II. Exact computation and parameterized algorithms (8 weeks)
Part III. Introduction to approximation algorithms and randomized algorithms (3 weeks)
Academic Dishonesty:
It is expected that the work you submit is your own. Plagiarism and other
forms of academic dishonesty will be handled within the guidelines of
the Student Handbook. The usual penalty for academic dishonesty is loss of
credit for the assignment in question; however,
stronger measures may be taken when conditions warrant.
Attendance policy:
Regular class attendance is required though class attendance may not be
used in the final determination of grades.
Students are required to attend class during the regularly scheduled
tests and the final exam unless prior arrangements have been made.