# Approximation Algorithms

## CSCI-6040

Algorithms with provable guarantees on the quality of their solutions are a powerful way of dealing with intractable problems. This course covers fundamental techniques for designing approximation algorithms. Possible topics include: semi-definite and linear programming, inapproximability and the PCP theorem, randomized rounding, metrics and cuts, primal-dual methods, and online algorithms.

4 credits
Cross-listed with:
CSCI-4040 Approximation Algorithms
Prereqs:
none

# Past Term Data
Offered
Not Offered
Offered as Cross-Listing Only
No Term Data
Simple View
Detailed View

| Spring | Summer | Fall
--- | --- | --- | ---
| (Session 1) | (Session 2) |
2026 |  |  |

2025

Approximation Algorithms (4c)

- Elliot I. Anshelevich

Seats Taken: 13/15

2024 |  |  |
2023 |  |  |
2022 |  |  |

2021

Approximation Algorithms (4c)

- Elliot I. Anshelevich

Seats Taken: 13/15

2020 |  |  |
2019 |  |  |
2018 |  |  |

2017

Approximation Algorithms (4c)

- Elliot I. Anshelevich

Seats Taken: 12/15

2016 |  |  |
2015 |  |  |
2014 |  |  |
2013 |  |  |
2012 |  |  |
2011 |  |  |
2010 |  |  |
2009 |  |  |
2008 |  |  |
2007 |  |  |
2006 |  |  |
2005 |  |  |
2004 |  |  |
2003 |  |  |
2002 |  |  |
2001 |  |  |
2000 |  |  |
1999 |  |  |
1998 |  |  |