Per Austrin, Rajsekar Manokaran, Cenny Wenner: On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems. APPROX-RANDOM 2013: 26-41