Per Austrin, Aleksa Stankovic. Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder. In Dimitris Achlioptas, László A. Végh, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA. Volume 145 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]
@inproceedings{AustrinS19,
title = {Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder},
author = {Per Austrin and Aleksa Stankovic},
year = {2019},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.24},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.24},
researchr = {https://researchr.org/publication/AustrinS19},
cites = {0},
citedby = {0},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA},
editor = {Dimitris Achlioptas and László A. Végh},
volume = {145},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-125-2},
}