CS60035/CS60086 Selected Topics in Algorithms Autumn 2016, L-T-P: 3-0-0

Grades

Schedule

Instructor     Abhijit Das
Timing     Slot F [WED (10:00–10:55), THU (09:00–10:00), FRI (11:00–11:55)]
Venue     Room No CSE–120
Teaching Assistants     Pritam Bhattacharya, Rajesh Basak

Syllabus

This course deals with solving computationally difficult problems. Three broad approaches will be covered.

This course has no official prerequisites. This is however an advanced course in algorithms. It is implicitly expected that the registrants have already gone through the basic courses on algorithms. For analyzing randomized algorithms, an introductory knowledge in probability (random variables, expectation) will be needed. Students from CS, IT, EC, EE and MA are expected to have this background. Students from other deartments may find this course too difficult and/or too irrelevant.

Books and References

I will mostly use the following book (Chapters 2–5):

Juraj Hromkovič, Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics, second edition, Springer-Verlag, 2004, ISBN: 978-3-540-44134-2.
Some other references are:

Tests


Home  |  Autumn 2015