Readings
From ResearchWiki
(Difference between revisions)
(→Other Topics) |
(→Oct 21 ??) |
||
| Line 6: | Line 6: | ||
* [http://arxiv.org/abs/1102.5391 Simple Proofs of Classical Theorems in Discrete Geometry via the Guth--Katz Polynomial Partitioning Technique] | * [http://arxiv.org/abs/1102.5391 Simple Proofs of Classical Theorems in Discrete Geometry via the Guth--Katz Polynomial Partitioning Technique] | ||
| - | === Oct | + | === Oct 25 @ 4pm === |
New results on metric TSPs | New results on metric TSPs | ||
Latest revision as of 19:14, 19 October 2011
Summary page for readings.
Sep 30
The Guth-Katz results and ramifications.
Oct 25 @ 4pm
New results on metric TSPs
- A Randomized Rounding Approach to the Traveling Salesman Problem and some slides
- Approximating graphic TSP by matchings
Other Topics
- unique games
- lift and project methods for LPs
- New results for the k-server conjecture (polylog approximation)
- LP-formulation for iterative reweighting.
- Quantum proofs of classical theorems
- polylog competitive algorithm for k-server
