Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Cooperative facility location games
.879-approximation algorithms for MAX CUT and MAX 2SAT
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC ’94
Journal of the ACM
Journal of Algorithms
David P. Williamson
Martin Skutella
Some new cooperative coverage facility location games
Approximating the cut-norm via Grothendieck’s inequality
A unified approach to scheduling on unrelated parallel machines
Random sampling and approximation of MAX-CSP problems