@InProceedings{makarychev:LIPIcs.STACS.2013.139,
author = {Makarychev, Konstantin},
title = {{Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs}},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
pages = {139--147},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-50-7},
ISSN = {1868-8969},
year = {2013},
volume = {20},
editor = {Portier, Natacha and Wilke, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.139},
URN = {urn:nbn:de:0030-drops-39290},
doi = {10.4230/LIPIcs.STACS.2013.139},
annote = {Keywords: approximation algorithms, approximation resistance, ordering CSPs}
}