Improved Approximation Algorithms for Projection Games

Author(s)
Manurangsi, Pasin; Moshkovitz Aaronson, Dana Hadar
Thumbnail
DownloadMoshkovitz_Improved approximation.pdf (724.1Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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.
Date issued
2013
URI
http://hdl.handle.net/1721.1/90487
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Algorithms – ESA 2013
Publisher
Springer-Verlag
Citation
Manurangsi, Pasin, and Dana Moshkovitz. “Improved Approximation Algorithms for Projection Games.” Lecture Notes in Computer Science (2013): 683–694.
Version: Author's final manuscript
ISBN
978-3-642-40449-8
978-3-642-40450-4
ISSN
0302-9743
1611-3349
Collections