Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{huang_et_al:LIPIcs:2020:12661, author = {Neng Huang and Aaron Potechin}, title = {{On the Approximability of Presidential Type Predicates}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)}, pages = {58:158:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771641}, ISSN = {18688969}, year = {2020}, volume = {176}, editor = {Jaros{\l}aw Byrka and Raghu Meka}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12661}, URN = {urn:nbn:de:0030drops126612}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.58}, annote = {Keywords: constraint satisfaction problems, approximation algorithms, presidential type predicates} }
Keywords:  constraint satisfaction problems, approximation algorithms, presidential type predicates  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)  
Issue Date:  2020  
Date of publication:  11.08.2020 