Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Improved Approximation Algorithms for Projection Games

Improved Approximation Algorithms for Projection Games

Thumbnail Image
Download
Name

Moshkovitz_Improved approximation.pdf

Size

724.1 KB

Format

Adobe PDF

Checksum (MD5)

918f8e651625e227c74fc5fd987e357a

Author(s)
Manurangsi, Pasin
•
Moshkovitz Aaronson, Dana Hadar
Date Issued
2013
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
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/90487
DOI of Published Version
https://doi.org/10.1007/978-3-642-40450-4_58
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.