Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
A combinatorial, primal-dual approach to semidefinite programs
Approximation schemes for Euclidean k-medians and related problems
Proof verification and the hardness of approximation problems
Subexponential Algorithms for Unique Games and Related Problems
Unique games on expanding constraint graphs are easy
Journal of the ACM
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC ’07
Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08
Lecture Notes in Computer Science
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98
Journal of Computer and System Sciences
David Steurer
Satyen Kale
Shmuel Safra
Nisheeth K. Vishnoi
Madhur Tulsiani
Satish Rao
Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean Space
Online kernel PCA with entropic matrix updates
Random sampling and approximation of MAX-CSP problems
The geometric maximum traveling salesman problem
Bypassing the embedding
A near-linear time ?-approximation algorithm for geometric bipartite matching