Proof verification and the hardness of approximation problems
Priority sampling for estimation of arbitrary subset sums
On the hardness of approximating minimization problems
Journal of the ACM
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC ’93
Mikkel Thorup
Madhu Sudan
Rajeev Motwani
Sanjeev Arora
Mihalis Yannakakis
Mario Szegedy
The geometric maximum traveling salesman problem
Bypassing UGC from Some Optimal Geometric Inapproximability Results
Two prover protocols
Continuous matrix approximation on distributed data