|
Nov 10, 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).
Add to Portfolio (opens a new window)
|
|