Department of Computer Science, Dartmouth College

** Mail:** Room 110 ECSC, 15 Thayer Drive, Hanover, NH 03755

**Email:** deeparnab@dartmouth.edu, deeparnab@gmail.com

A first course on approximation algorithms taught at Dartmouth; I usually teach 27 of these lectures.

- Introduction to Approximation Algorithms
- Greedy Approximation Algorithm for Set Cover
- Greedy Approximation Algorithm for Facility Location
- Greedy Approximation Algorithms and Submodularity
- Double Greedy Approximation Algorithm for Unconstrained Submodular Function Maximization
- Local Search Algorithms for Max Cut and Max Coverage
- Non Ob(li)vious Local Search for Max 2SAT
- Local Search for Facility Location
- Local Search for k-Median
- Polynomial Time Approximation Scheme for Load Balancing
- Linear Programming Relaxations for Vertex Cover
- Crash Course in Linear Programming I
- Deterministic Rounding : Matchings in Uniform Hypergraphs
- Deterministic Rounding : Bipartite Matching and GAP
- Deterministic Rounding : Pipage Rounding
- Deterministic Rounding : 4-approximation for Facility Location
- Deterministic Rounding : k-Median
- Randomized Rounding : Set Cover and Independent Set
- Randomized Rounding : Vertex Cover in k-Partite Hypergraphs
- Randomized Rounding : Max SAT
- Randomized Rounding : Congestion Minimization
- Crash Course in Linear Programming II : The Dual
- Using the Dual : Set Cover and Vertex Cover
- Using the Dual : Facility Location
- Using the Dual : Steiner Forest
- Using the Dual : Approximately Solving Covering LPs
- Ellipsoid Algorithms and LPs with lots of constraints
- Cut Problems : s,t-cut and Multiway Cut
- Cut Problems : two algorithms for multicut
- Cut Problems : Uniform Sparsest Cut
- Cut Problems : Generalized Sparsest Cut
- Cut Problems : Bourgain's Embedding via Padded Decompositions
- Semidefinite Programming
- SDP : Goemans-Williamson Algorithm for Max Cut
- SDP : Karger-Motwani-Sudan for coloring 3-colorable graphs