Go to the corresponding LIPIcs Volume Portal |
pdf-format: |
|
@InProceedings{makarychev:LIPIcs:2013:3929, author = {Konstantin Makarychev}, 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 = {Natacha Portier and Thomas Wilke}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3929}, URN = {urn:nbn:de:0030-drops-39290}, doi = {10.4230/LIPIcs.STACS.2013.139}, annote = {Keywords: approximation algorithms, approximation resistance, ordering CSPs} }
Keywords: | approximation algorithms, approximation resistance, ordering CSPs | |
Collection: | 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) | |
Issue Date: | 2013 | |
Date of publication: | 26.02.2013 |