APPROXIMATION ALGORITHMS

Section

Professor

Jay Sethuraman

Survey Results

3 of 4 students responded

Instructor: Organization and Preparation4
Instructor: Classroom Delivery4
Instructor: Approachability5
Instructor: Overall Quality4
Course: Amount Learned4.33
Course: Appropriateness of Workload3.67
Course: Fairness of Grading Process3.67
Course: Quality of Text4
Course: Overall Quality4.33

Course Information

Prerequisites: Basic knowledge of linear programming and analysis of algorithms or combinatorial optimization. The design and analysis of efficient algorithms for providing near-optimal solutions to NP-hard problems. Classic algorithms and recent techniques for approximation algorithms.

Department: Industrial Engineering and Operations Research(IEOR)

Subject: Industrial Engineering and Operations Research(IEOR)

School: Fu Foundation School of Engineering and Applied Science

Division: School of Engineering and Applied Science: Graduate

Course ID: 6610