This course teaches techniques for efficiently finding near-optimal solutions to computationally hard problems.
Course Details
| Language | English |
| Duration | 4 weeks |
| Effort | 6 hours/week |
Description
Many real-world algorithmic problems cannot be solved efficiently using traditional algorithmic tools, for example, because the problems are NP-hard. The goal of the Approximation Algorithms course is to become familiar with important algorithmic concepts and techniques needed to effectively deal with such problems. These techniques apply when we don't require the optimal solution to certain problems, but an approximation that is close to the optimal solution. We will see how to efficiently find such approximations. The material for this course is based on the course notes that can be found under the Course Notes on Approximation Algorithms tab.About This Course
Requirements
Prerequisites:
In order to successfully take this course, you should already have a basic knowledge of algorithms and mathematics. Here's a short list of what you are supposed to know:
