EdusalsaDiscover Your Stanford

MS&E 319

Approximation Algorithms

  • Not Offered

3 units

Letter or Credit/No Credit

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.

Course Prequisites

Sections

Section Information Unavailable

Sign Up

To save MS&E 319 to your course bucketlist

Already Have An Account? Log In