Per Austrin, Rajsekar Manokaran, Cenny Wenner. On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems. Theory of Computing, 11:257-283, 2015. [doi]
@article{AustrinMW15,
title = {On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems},
author = {Per Austrin and Rajsekar Manokaran and Cenny Wenner},
year = {2015},
doi = {10.4086/toc.2015.v011a010},
url = {http://dx.doi.org/10.4086/toc.2015.v011a010},
researchr = {https://researchr.org/publication/AustrinMW15},
cites = {0},
citedby = {0},
journal = {Theory of Computing},
volume = {11},
pages = {257-283},
}