|
Nov 25, 2024
|
|
|
|
APM 665 - Approximation and Randomized Discrete Algorithms (4 credits)
Approximation and randomized algorithms of NP-hard problems. Algorithms discussed include those based on LP duality, greedy approach and semidefinite approach.
Prerequisite(s): Student must meet prerequisites (MOR 554 and APM 569).
Course updates made after the Graduate Catalog publication date will be posted in the Addendum to the Graduate Catalog.
Add to Portfolio (opens a new window)
|
|