Suprovat Ghoshal, Anand Louis. Approximation Algorithms and Hardness for Strong Unique Games. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021. pages 414-433, SIAM, 2021. [doi]
@inproceedings{GhoshalL21, title = {Approximation Algorithms and Hardness for Strong Unique Games}, author = {Suprovat Ghoshal and Anand Louis}, year = {2021}, doi = {10.1137/1.9781611976465.26}, url = {https://doi.org/10.1137/1.9781611976465.26}, researchr = {https://researchr.org/publication/GhoshalL21}, cites = {0}, citedby = {0}, pages = {414-433}, booktitle = {Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021}, editor = {Dániel Marx}, publisher = {SIAM}, isbn = {978-1-61197-646-5}, }