2019-2020 2020-2021 2021-2022 2022-2023 2023-2024
Browse
by subject...
    Schedule
view...
 

1 - 1 of 1 results for: MS&E 319: Approximation Algorithms

MS&E 319: Approximation Algorithms

Combinatorial and mathematical programming techniques to derive approximation algorithms for NP-hard optimization problems. Prossible topics include: greedy algorithms for vertex/set cover; rounding LP relaxations of integer programs; primal-dual algorithms; semidefinite relaxations. May be repeated for credit. Prerequisites: 112 or CS 161.
| Repeatable for credit
Filter Results:
term offered
updating results...
teaching presence
updating results...
number of units
updating results...
time offered
updating results...
days
updating results...
UG Requirements (GERs)
updating results...
component
updating results...
career
updating results...
© Stanford University | Terms of Use | Copyright Complaints