Improved Approximation Algorithms for Projection Games

(Extended Abstract)
  • Pasin Manurangsi
  • Dana Moshkovitz
Conference paper

DOI: 10.1007/978-3-642-40450-4_58

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8125)
Cite this paper as:
Manurangsi P., Moshkovitz D. (2013) Improved Approximation Algorithms for Projection Games. In: Bodlaender H.L., Italiano G.F. (eds) Algorithms – ESA 2013. ESA 2013. Lecture Notes in Computer Science, vol 8125. Springer, Berlin, Heidelberg

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. 1

    A polynomial-time approximation algorithm that improves on the previous best approximation by Charikar, Hajiaghayi and Karloff [7].

     
  2. 2

    A sub-exponential time algorithm with much tighter approximation for the case of smooth projection games.

     
  3. 3

    A PTAS for planar graphs.

     

Keywords

Label-Cover projection games 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Pasin Manurangsi
    • 1
  • Dana Moshkovitz
    • 1
  1. 1.Massachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations