Select the desired Level or Schedule Type to find available classes for the course. |
CSCI 2510 - Approximation Algorithms |
Approximation Algorithms deal with NP-hard combinatorial optimization problems by efficiently constructing a suboptimal solution with some specified quality guarantees. We study techniques such as linear programming and semidefinite programming relaxations, and apply them to problems such as facility location, scheduling, bin packing, maximum satifiability or vertex cover. Prerequisite - one of the following: CSCI 1510, 1550, 1810, 1950J, 1950L, any graduate-level course on algorithms (including 2500A, 2500B, 2580).
1.000 Credit hours 1.000 Lecture hours Levels: Graduate, Undergraduate Schedule Types: Primary Meeting Computer Science Department Prerequisites: Undergraduate level CSCI 1510 Minimum Grade of S or Undergraduate level CSCI 1550 Minimum Grade of S or Undergraduate level CSCI 1810 Minimum Grade of S or Undergraduate level CSCI 1950J Minimum Grade of S or Undergraduate level CSCI 1950L Minimum Grade of S or Graduate level CSCI 2500A Minimum Grade of S or Graduate level CSCI 2500B Minimum Grade of S or Graduate level CSCI 2580 Minimum Grade of S |
Return to Previous | New Search |