2013-2014 2014-2015 2015-2016 2016-2017 2017-2018
Browse
by subject...
    Schedule
view...
 

1 - 1 of 1 results for: CS 369A: Topics in Analysis of Algorithms: Advanced Approximation Algorithms

CS 369A: Topics in Analysis of Algorithms: Advanced Approximation Algorithms

Optimization problems are ubiquitous, yet most are NP-hard to solve exactly. One popular approach to circumvent this intractability is to design approximation algorithms, i.e. efficient algorithms that produce solutions with value close to the optimum. This course will cover major advances in the field of approximation algorithms in the past decade or so. Prerequisites: Students will be expected to have a strong background in algorithms and probability. Familiarity with basic approximation algorithms (or permission of instructor).
Terms: Win | Units: 3 | Grading: Letter or Credit/No Credit
Filter Results:
term offered
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