Go to Main Content

Brown University



Detailed Course Information


Spring 2017
May 30, 2020
Transparent Image
  Select the desired Level or Schedule Type to find available classes for the course.

CSCI 2956R - Multiplicative-Weights/Packing-Covering Method for Approximating Linear and Semidefinite Programs
We will study the method called, variously, multiplicative weights and packing-covering. We will in particular investigate the use of this method for finding approximately optimal solutions to linear programs and semidefinite programs. Prerequisite: A graduate-level course on algorithms. Enrollment limited to 10. Instructor permission required.
0.500 Credit hours
0.500 Lecture hours

Levels: Graduate, Undergraduate
Schedule Types: Primary Meeting

Computer Science Department

Return to Previous New Search
Transparent Image
Skip to top of page