%0 Conference Paper %1 conf/innovations/LeeM24 %A Lee, Euiwoong %A Manurangsi, Pasin %B ITCS %D 2024 %E Guruswami, Venkatesan %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 71:1-71:17 %T Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs. %U http://dblp.uni-trier.de/db/conf/innovations/innovations2024.html#LeeM24 %V 287 %@ 978-3-95977-309-6

@inproceedings{conf/innovations/LeeM24, added-at = {2024-10-06T00:00:00.000+0200}, author = {Lee, Euiwoong and Manurangsi, Pasin}, biburl = {https://www.bibsonomy.org/bibtex/2335cc27c4db2ed13ce8eba507b796234/dblp}, booktitle = {ITCS}, crossref = {conf/innovations/2024}, editor = {Guruswami, Venkatesan}, ee = {https://doi.org/10.4230/LIPIcs.ITCS.2024.71}, interhash = {44e6b26efb1026c5e759c667e65c3809}, intrahash = {335cc27c4db2ed13ce8eba507b796234}, isbn = {978-3-95977-309-6}, keywords = {dblp}, pages = {71:1-71:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-10-07T09:24:43.000+0200}, title = {Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs.}, url = {http://dblp.uni-trier.de/db/conf/innovations/innovations2024.html#LeeM24}, volume = 287, year = 2024 }