Improved Approximation Algorithms for Projection Games
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 p...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
Springer US
2017
|
Online Access: | http://hdl.handle.net/1721.1/106639 https://orcid.org/0000-0002-5157-8086 |