Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
SIAM Journal on Computing
Moses Charikar
Prasad Raghavendra
Johan Håstad
Venkatesan Guruswami
Bypassing UGC from Some Optimal Geometric Inapproximability Results