Approximating Unique Games Using Low Diameter Graph Decomposition
o ( sqrt ( log n ) ) approximation algorithms for min uncut , min 2cnf deletion , and directed cut problems .