The topic must cover some recent research from the field of approximation algorithms. Below is a list of suggested topics. You may choose a topic not listed, but it has to meet with my approval.

Send me an email when you have chosen a topic. This must be done no later than Nov 15, but I encourage you to get started earlier as reading research papers can take time.

- Your talk should focus more on stating the results cleanly and going over the important ideas that lead to the result.
- Do not present every detail of every proof, but still convince me that you understand the work. This is a bit of a balancing act; erring on the side of a cleaner presentation is preferred.
- I want a clear view of the context of the paper(s) you present. What was known before and how did they help advance the state of the art?
- What related problems are left to address?

This is far from a comprehensive list. Please feel free to ask me for more suggestions. If you have a particular topic in mind but cannot find a related paper, then I might be able to help.

- Approximating k-median via Pseudo-Approximation
- Santa Claus Meets Hypergraph Matchings
- LP-Based Algorithms for Capacitated Facility Location
- Centrality of Trees for Capacitated k-Center
- A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
- Approximating Graphic TSP by Matchings
- An O(log n / loglog n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem
- Asymmetric Traveling Salesman Path and Directed Latency Problems
- Approximation Algorithms for Regret-Bounded Vehicle Routing and Applications to Distance-Constrained Vehicle Routing
- Multiway Cut, Pairwise Realizable Distributions, and Descending Thresholds
- Approximating Bin Packing within O(log OPT * log log OPT) bins
- Steiner Tree Approximation via Iterative Randomized Rounding
- The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus
- Approximation Schemes for Maximum Weight Independent Set of Rectangles
- On the Non-Uniform Sparsest Cut Problem on Bounded Treewidth Graphs