Skip to main content
Skip to main menu

Slideshow

CSCI 6480

Approximation Algorithms

This is a graduate-level course on algorithms for finding approximate solutions to NP-complete problems. It introduces the class NP and explores the importance of the NP-complete problems. Approaches for finding approximate.

Not offered on a regular basis.

Bulletin:
http://bulletin.uga.edu/CoursesHome.aspx

Credit Hours:
4
Prerequisites:
CSCi 2670 or Permission of Department
Level:

Support us

We appreciate your financial support. Your gift is important to us and helps support critical opportunities for students and faculty alike, including lectures, travel support, and any number of educational events that augment the classroom experience. Click here to learn more about giving.

Every dollar given has a direct impact upon our students and faculty.