Joshua Brakensiek, Venkatesan Guruswami. The Quest for Strong Inapproximability Results with Perfect Completeness. In Klaus Jansen, José D. P. Rolim, David Williamson, Santosh Srinivas Vempala, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA. Volume 81 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]
@inproceedings{BrakensiekG17-0,
title = {The Quest for Strong Inapproximability Results with Perfect Completeness},
author = {Joshua Brakensiek and Venkatesan Guruswami},
year = {2017},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.4},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.4},
researchr = {https://researchr.org/publication/BrakensiekG17-0},
cites = {0},
citedby = {0},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA},
editor = {Klaus Jansen and José D. P. Rolim and David Williamson and Santosh Srinivas Vempala},
volume = {81},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-044-6},
}