Approximation Algorithms (Advanced)
Lecturers and Teaching Assistants
Prof. Uriel Feige
Course Schedule and Location
Wednesday, 14:15 - 16:00, Ziskind, Rm 1
Field of Study, Course Type and Credit Points
Mathematics and Computer Science: Elective; 2.00 points
Course will take place if there is sufficient interest by students who took the first semester course, or an equivalent course.
Final assignment might either be a take home exam, or some other assignment.
The first semester course on approximation algorithms, or an equivalent course.
Attendance and participation
Estimated Weekly Independent Workload (in hours)
Advanced topics in approximation algorithms, going deeper into the same topics that are studied in a more superficial level in the first semester introductory course.
Upon successful completion of this course students should be able to:
Demonstrate familiarity with advanced topics in approximation algorithms, sufficient for conducting research in this area.
Advanced topics from the book of Williamson and Shmoys, and possibly some papers that appeared in recent years.