120 search results - page 18 / 24 » Spectral Algorithms for Unique Games |
APPROX
2011
Springer
12 years 7 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
CDC
2009
IEEE
14 years 3 days ago
2009
IEEE
Abstract— Generalized Nash equilibria (GNE) represent extensions of the Nash solution concept when agents have shared strategy sets. This generalization is particularly relevant ...
INFOCOM
2012
IEEE
11 years 9 months ago
2012
IEEE
—Recent advances in cognitive radio (CR) technology have brought about a number of wireless standards that support opportunistic access to available white-space spectrum. Address...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...