%0 Journal Article %1 journals/toc/AustrinMW15 %A Austrin, Per %A Manokaran, Rajsekar %A Wenner, Cenny %D 2015 %J Theory of Computing %K dblp %P 257-283 %T On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems. %U http://dblp.uni-trier.de/db/journals/toc/toc11.html#AustrinMW15 %V 11

@article{journals/toc/AustrinMW15, added-at = {2019-05-14T00:00:00.000+0200}, author = {Austrin, Per and Manokaran, Rajsekar and Wenner, Cenny}, biburl = {https://www.bibsonomy.org/bibtex/2c6161c064aa07887492ffdca66d584e2/dblp}, ee = {https://doi.org/10.4086/toc.2015.v011a010}, interhash = {f5b1310f1b4db5e5860263e655607de4}, intrahash = {c6161c064aa07887492ffdca66d584e2}, journal = {Theory of Computing}, keywords = {dblp}, pages = {257-283}, timestamp = {2019-05-15T11:37:58.000+0200}, title = {On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems.}, url = {http://dblp.uni-trier.de/db/journals/toc/toc11.html#AustrinMW15}, volume = 11, year = 2015 }