COMPSCI 232 - Approximation Algorithms

Institution:

Duke University

Subject:

Computer Science

Description:

Cover traditional approximation algorithms with combinatorial and linear programming techniques; extended survey of cut problems and metric embeddings; embeddings, dimensionality reduction, locality sensitive hashing, and game theory. Instructor: Agarwal or Munagala

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

WWW.DUKE.EDU

Phone Number:

(919) 684-8111

Regional Accreditation:

Southern Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.