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. Credit Hours: 4 Prerequisites: CSCi 2670 or Permission of Department Level: Graduate
