MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "Approximation Algorithms for Unique Games." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 8 documents found, showing 1 through 8.
ATOM RSS
  • How to play unique games using embeddings  
  • by Eden Chlamtac, Konstantin Makarychev, Yury Makarychev — 2006 — In 47th Annual Syposium on Foundations of Computer Science
  • … approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε…
  • Cited by 5 (0 self) – Add To MetaCart
  • Near-optimal algorithms for Unique Games  
  • by Moses Charikar, Konstantin Makarychev, Yury Makarychev — 2006 — In Proceedings of the 38th Annual ACM Symposium on Theory of Computing
  • … than a random assignment. The first approximation algorithm for general unique games was given by Khot…
  • Cited by 12 (2 self) – Add To MetaCart
  • Approximate kernel clustering  
  • by Subhash Khot, Assaf Naor
  • …, when k = 3 we obtain a 27 approximation algorithm, and we show that assuming the Unique Games…
  • Add To MetaCart
  • unknown title  
  • by unknown authors
  • … obtain a 16 ss27 approximation algorithm, and we show that assuming the Unique Games Conjecture (UGC…
  • Add To MetaCart
  • unknown title  
  • by Subhash Khot, Assaf Naor
  • …. Then our algorithm achieves a π 2 approximation factor. Assuming the Unique Games Conjecture no polynomial…
  • Add To MetaCart
Help! Showing 1 through 8.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB