pdf-format: |
|
@InProceedings{manurangsi_et_al:LIPIcs:2015:5314, author = {Pasin Manurangsi and Dana Moshkovitz}, title = {{Approximating Dense Max 2-CSPs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)}, pages = {396--415}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-89-7}, ISSN = {1868-8969}, year = {2015}, volume = {40}, editor = {Naveen Garg and Klaus Jansen and Anup Rao and Jos{\'e} D. P. Rolim}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5314}, URN = {urn:nbn:de:0030-drops-53149}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2015.396}, annote = {Keywords: Max 2-CSP, Dense Graphs, Densest k-Subgraph, QPTAS, Free Games, Projection Games} }
Keywords: | Max 2-CSP, Dense Graphs, Densest k-Subgraph, QPTAS, Free Games, Projection Games | |
Seminar: | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015) | |
Issue date: | 2015 | |
Date of publication: | 13.08.2015 |