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
- CSE290A - Randomized Algorithmsusers.soe.ucsc.edu
- CSE 599 Counting and Samplinghomes.cs.washington.edu
- Thatchaphol Saranurak - Graph Decompositionsites.google.com
- probmethod_notes.pdfyufeizhao.com
- [2608.00140] Discrepancy Theory: An Algorithmic and Geometric Perspectivearxiv.org
- 1404.5236 Sum-of-Squares Proofs and the Quest toward Optimal Algorithmsarxiv.org
- Tim Kunisky - Homekunisky.com
- IPAM program in quantitative linear algebra, Mar 19-Jun 15 2018terrytao.wordpress.com
- Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizesarxiv.org
- Statistics 386 Winter 2013galton.uchicago.edu
- Cover times - spectralarxiv.org
- my projectsdan-iel-lee.vercel.app