pdfformat: 

@InProceedings{makarychev:LIPIcs:2013:3929, author = {Konstantin Makarychev}, title = {{Local Search is Better than Random Assignment for Bounded Occurrence Ordering kCSPs}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {139147}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897507}, ISSN = {18688969}, year = {2013}, volume = {20}, editor = {Natacha Portier and Thomas Wilke}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3929}, URN = {urn:nbn:de:0030drops39290}, doi = {10.4230/LIPIcs.STACS.2013.139}, annote = {Keywords: approximation algorithms, approximation resistance, ordering CSPs} }
Keywords:  approximation algorithms, approximation resistance, ordering CSPs  
Seminar:  30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)  
Issue date:  2013  
Date of publication:  26.02.2013 