Improved Approximation Algorithms for Projection Games

Author(s)
Manurangsi, Pasin; Moshkovitz Aaronson, Dana Hadar
Thumbnail
Download453_2015_88_ReferencePDF.pdf (708.7Kb)
PUBLISHER_POLICY
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
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 et al. (Algorithmica 61(1):190–206, 2011). (2) A sub-exponential time algorithm with much tighter approximation for the case of smooth projection games. (3) A polynomial-time approximation scheme (PTAS) for projection games on planar graphs and a tight running time lower bound for such approximation schemes. The conference version of this paper had only the PTAS but not the running time lower bound.
Date issued
2015-11
URI
http://hdl.handle.net/1721.1/106639
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Department of Mathematics
Journal
Algorithmica
Publisher
Springer US
Citation
Manurangsi, Pasin, and Dana Moshkovitz. “Improved Approximation Algorithms for Projection Games.” Algorithmica 77, no. 2 (November 4, 2015): 555–594.
Version: Author's final manuscript
ISSN
0178-4617
1432-0541
Collections