Random sampling and approximation of MAX-CSP problems
Random sampling and approximation of MAX-CSPs
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
On-Line Load Balancing for Related Machines
Journal of Computer and System Sciences
Journal of Algorithms
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC ’02
Noga Alon
Ravi Kannan
David Karger
W.Fernandez de la Vega
Sanjeev Arora
Moses Charikar
Online load balancing on related machines
Sampling from large matrices
Approximating the cut-norm via Grothendieck’s inequality