| dc.contributor.author | Manurangsi, Pasin | |
| dc.contributor.author | Moshkovitz Aaronson, Dana Hadar | |
| dc.date.accessioned | 2014-09-30T17:36:49Z | |
| dc.date.available | 2014-09-30T17:36:49Z | |
| dc.date.issued | 2013 | |
| dc.identifier.isbn | 978-3-642-40449-8 | |
| dc.identifier.isbn | 978-3-642-40450-4 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/90487 | |
| dc.description.abstract | The projection games (aka Label-Cover) problem is of great importance to the field of approximation algorithms, since most of the NP-hardness of approximation results we know today are reductions from Label-Cover. In this paper we design several approximation algorithms for projection games:
1. A polynomial-time approximation algorithm that improves on the previous best approximation by Charikar, Hajiaghayi and Karloff [7].
2. A sub-exponential time algorithm with much tighter approximation for the case of smooth projection games.
3. A PTAS for planar graphs. | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Grant 1218547) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Springer-Verlag | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1007/978-3-642-40450-4_58 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | arXiv | en_US |
| dc.title | Improved Approximation Algorithms for Projection Games | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Manurangsi, Pasin, and Dana Moshkovitz. “Improved Approximation Algorithms for Projection Games.” Lecture Notes in Computer Science (2013): 683–694. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.mitauthor | Manurangsi, Pasin | en_US |
| dc.contributor.mitauthor | Moshkovitz Aaronson, Dana Hadar | en_US |
| dc.relation.journal | Algorithms – ESA 2013 | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dspace.orderedauthors | Manurangsi, Pasin; Moshkovitz, Dana | en_US |
| dc.identifier.orcid | https://orcid.org/0000-0002-5157-8086 | |
| dspace.mitauthor.error | true | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |
