|
Aug 30, 2024
|
|
|
|
APM 6665 - 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. Formerly APM 665.
Prerequisite(s): Student must meet prerequisites (MOR 5554 and APM 5669).
Course revisions made after the Graduate Catalog publication date will be posted in the Graduate Catalog Addendum.
Add to Portfolio (opens a new window)
|
|