Improved Approximation Algorithms for Projection Games

Autor:	Manurangsi, Pasin, Moshkovitz, Dana
Rok vydání:	2014
Předmět:	Computer Science - Data Structures and Algorithms
Druh dokumentu:	Working Paper
DOI:	10.1007/s00453-015-0088-5
Popis:	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. 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. Comment: 41 pages, 2 figure
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1408.4048 Zobrazit plný text záznamu View this record from Arxiv