Home /

Courses

Find a Course

Use the menus below to help you find a course.

By Prefix and Number:

PREFIX:

NUMBER:

By Prefix:

Advanced Search

Keyword Search
Online Learning (E)
Service-Learning (S)
Honors (H)
Integrated Language (I)
Writing Intensive (W)
Non-Credit Discussion Group (D)
Lab (Non-Credit and Credit) (L)

Quicklinks

Schedule of Classes
Transfer Equivalency Search
Course Application Deadlines


Course ID:	CSCI 6480. 4 hours.
Course Title:	Approximation Algorithms
Course Description:	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 solutions to many combinatorial and LP-based problems will be discussed.
Athena Title:	Approximation Algorithms
Prerequisite:	CSCI 2670 or permission of department
Semester Course Offered:	Not offered on a regular basis.
Grading System:	A-F (Traditional)

Syllabus: