Improved Approximation Algorithms for Projection Games
- 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
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:
A polynomial-time approximation algorithm that improves on the previous best approximation by Charikar, Hajiaghayi and Karloff .
A sub-exponential time algorithm with much tighter approximation for the case of smooth projection games.
A PTAS for planar graphs.
KeywordsLabel-Cover projection games
Unable to display preview. Download preview PDF.