Course Identification

Title:

Approximation Algorithms (Advanced)

Code:

20194102

Lecturers and Teaching Assistants

Lecturers:

Prof. Uriel Feige

TA's:

N/A

Course Schedule and Location

Year:

2019

Semester:

Second Semester

When / Where:

Wednesday, 14:15 - 16:00, Ziskind, Rm 1

First Lecture:

27/03/2019

Field of Study, Course Type and Credit Points

Mathematics and Computer Science: Elective; 2.00 points

Comments

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.

Prerequisites

The first semester course on approximation algorithms, or an equivalent course.

Restrictions

Participants:

50

Language of Instruction

English

Attendance and participation

Expected and Recommended

Grade Type

Pass / Fail

Grade Breakdown (in %)

Assignments:

50%

Final:

50%

Evaluation Type

Final assignment

Scheduled date 1

Date / due date

N/A

Location

N/A

Time

-

Remarks

N/A

Estimated Weekly Independent Workload (in hours)

4

Syllabus

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.

Learning Outcomes

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.

Reading List

Advanced topics from the book of Williamson and Shmoys, and possibly some papers that appeared in recent years.

Website

N/A