By Topic

Approximation algorithms for unique games

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Trevisan, L. ; Comput. Sci. Div., Calfornia Univ., Berkeley, USA

We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 - O(1/logn), satisfies a constant fraction of constraints, where n is the number of variables. For sufficiently large alphabets, it improves an algorithm of Khot (STOC'02) that satisfies a constant fraction of constraints in unique games of value 1 -O(1/(k10(log k)5)), where k is the size of the alphabet. We also present a simpler algorithm for the special case of unique games with linear constraints. Finally, we present a simple approximation algorithm for 2-to-1 games.

Published in:

Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on

Date of Conference:

23-25 Oct. 2005