E0 249: Approximation Algorithms, Spring 2015.

Instructors: Arnab Bhattacharyya and Deeparnab Chakrabarty

Course Description
Most optimization problems turn out to be NP-hard and this has led to the study of algorithms which return an approximate solution in polynomial time. Over the past three decades, many techniques have been developed for the design and analysis of approximation algorithms. In this course, we will survey these techniques illustrating their applications on various optimization problems.

Recommended Books
Project. The webpage containing info about the project is up here .

Midterm The Midterm will be held in class from 2pm to 5pm on 27th February, 2015. Students can bring in one sheet of paper with stuff written in their own handwriting. They will have to submit this along with their answer sheets.

Problem Sets
We will periodically post assignments with dates when they need to be submitted. All submissions need to be via email to eo249iisc[AT]gmail.com (save those trees). We really prefer LaTeXed solutions.

After (or sometimes before) lectures, we will write a blurb on what we did and provide references to where the material is from. Sometimes we may provide pdfs of rough notes. Warning: the notes are really rough in that we write them in one pass and don't necessarily go over them again. So they may contain mistakes. If you find one, please let us know and we address them soon.