Oleg Verbitsky On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE. 167-180 1995 4 Combinatorics, Probability & Computing db/journals/cpc/cpc4.html#Verbitsky95