@InProceedings{chen_et_al:LIPIcs.STACS.2013.148,
author = {Chen, Xi and Dyer, Martin and Goldberg, Leslie Ann and Jerrum, Mark and Lu, Pinyan and McQuillan, Colin and Richerby, David},
title = {{The complexity of approximating conservative counting CSPs}},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
pages = {148--159},
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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.148},
URN = {urn:nbn:de:0030-drops-39303},
doi = {10.4230/LIPIcs.STACS.2013.148},
annote = {Keywords: counting constraint satisfaction problem, approximation, complexity}
}