CSE 599 Recent Developments in Approximation Algorithms
In this course we study several of recent papers in the field of approximation algorithms. We focus on many of the underlying techniques including randomized rounding, spectral methods, random walks and real stable polynomials.
In this course we study several of recent papers in the field of approximation algorithms. We focus on many of the underlying techniques including randomized rounding, spectral methods, random walks and real stable polynomials. Administrative Information Instructor: Shayan Oveis Gharan Office Hours: By appointment, email me at shayan at cs dot washington dot edu. Lectures: Monday - Wednesday 4:00 - 5:20 at EEB 031 Assignments Problem Set 1, due date April 8th in class. Problem Set 2, due date April 20th in class. Problem Set 3, due date May 11th in class. Problem Set 4, due date…
saved by
related reading
- CSE 599 Counting and Samplinghomes.cs.washington.edu
- CSE290A - Randomized Algorithmsusers.soe.ucsc.edu
- Thatchaphol Saranurak - Graph Decompositionsites.google.com
- probmethod_notes.pdfyufeizhao.com
- course_stat_rl.pdfmit.edu
- Video Archiveintractability.princeton.edu
- rakhlin_mathstat_sp24.pdfmit.edu
- [2608.00140] Discrepancy Theory: An Algorithmic and Geometric Perspectivearxiv.org
- Total Search @ STOC 2025sites.google.com
- survey.dvimath.uchicago.edu
- SIAG on Optimization Views and News 33(1)siagoptimization.github.io
- 1404.5236 Sum-of-Squares Proofs and the Quest toward Optimal Algorithmsarxiv.org