research-article

Unique games on expanding constraint graphs are easy: extended abstract

Authors:

Subhash A. Khot,

Alexandra Kolla,

Madhur Tulsiani,

Nisheeth K. VishnoiAuthors Info & Claims

STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computing

Pages 21 - 28

https://doi.org/10.1145/1374376.1374380

Published: 17 May 2008 Publication History

Abstract

We present an efficient algorithm to find a good solution to the Unique Games problem when the constraint graph is an expander.

We introduce a new analysis of the standard SDP in this case that involves correlations among distant vertices. It also leads to a parallel repetition theorem for unique games when the graph is an expander.

References

[1]

Christoph Ambuehl, Monaldo Mastrolilli, and Ola Svensson. Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling. In Annual Symposium on Foundations of Computer Science, number 48, 2007.

Digital Library

[2]

Sanjeev Arora, Satish Rao, and Umesh V. Vazirani. Expander Flows, geometric embeddings and graph partitioning. In Proceedings of the ACM Symposium on the Theory of Computing, number 36, pages 222--231, 2004.

Digital Library

[3]

Jin-yi Cai, Anne Condon, and Richard J. Lipton. Playing games of incomplete information. In the 7th Annual Symposium on Theoretical Aspects of Computer Science, pages 58--69, 1990.

Digital Library

[4]

Moses Charikar, Konstantin Makarychev, and Yury Makarychev. Near--optimal algorithms for unique games. In Proceedings of the ACM Symposium on the Theory of Computing, number 38, pages 205--214, 2006.

Digital Library

[5]

Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest--cut. In Computational Complexity, 15(2):94--114, 2006.

Digital Library

[6]

Eden Chlamtac, Konstantin Makarychev, Yury Makarychev. How to play unique games using embeddings. In Annual Symposium on Foundations of Computer Science, number 47, pages 687--696, 2006.

Digital Library

[7]

Nikhil Devanur, Subhash Khot, Rishi Saket, and Nisheeth K. Vishnoi. Integrality gaps for sparsest cut and minimum linear arrangement problems. In Proceedings of the ACM Symposium on the Theory of Computing, number 38, pages 537--546, 2006.

Digital Library

[8]

Irit Dinur, Elchanan Mossel, and Oded Regev. Conditional hardness for approximate coloring. In Proceedings of the ACM Symposium on the Theory of Computing, number 38, pages 344--353, 2006.

Digital Library

[9]

Uriel Feige and Laszlo Lovasz. Two-prover one-round proof systems, their power and their problems. In Proceedings of the ACM Symposium on the Theory of Computing, number 24, pages 733--744, 1992.

Digital Library

[10]

Anupam Gupta and Kunal Talwar. Approximating unique games. In Proceedings of the Seventeenth Annual ACM--SIAM Symposium on Discrete Algorithms, pages 99--106, 2006.

Digital Library

[11]

Thomas Holenstein. Parallel repetition: simplifications and the no-signaling case. In Proceedings of the ACM Symposium on the Theory of Computing, number 39, pages 411--419, 2007.

Digital Library

[12]

Subhash Khot. On the power of unique 2-prover 1-round games. In Proceedings of the ACM Symposium on the Theory of Computing, number 34, pages 767--775, 2002.

Digital Library

[13]

Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O'Donnell. Optimal inapproximability results for max--cut and other 2-variable CSPs? In Annual Symposium on Foundations of Computer Science, number 45, pages 146--154, 2004.

Digital Library

[14]

Subhash Khot and Oded Regev. Vertex cover might be hard to approximate to within 2--eps. In Proceedings of the Annual IEEE Conference on Computational Complexity, number 18, pages 379--386, 2003.

[15]

Subhash Khot and Nisheeth K. Vishnoi. The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into 1'. In Annual Symposium on Foundations of Computer Science, number 46, pages 53--62, 2005.

Digital Library

[16]

Jean Bernard Lasserre. Global optimization with polynomials and the problem of moments. SIAM Journal on Optimization, 11:796--817, 2001.

Digital Library

[17]

Monique Laurent. A comparison of the Sherali-Adams, Lovasz--Schrijver and Lasserre relaxations for 0 -- 1 programming. Mathematics of Operations Research, 28(3):470--496, 2003.

Digital Library

[18]

Laszlo Lovasz and Alexander Schrijver. Cones of matrices and set-functions and 0--1 optimization. SIAM Journal on Optimization, 1(2):166--190, 1991.

[19]

Ran Raz. A parallel repetition theorem. In SIAM Journal of Computing, 27(3):763--803, 1998.

Digital Library

[20]

Anup Rao. Parallel Repetition in Projection Games and a Concentration Bound In Proceedings of the ACM Symposium on the Theory of Computing, number 40, 2008.

Digital Library

[21]

Shmuel Safra and Oded Schwartz. On Parallel--Repetition, Unique-Game and Max-Cut. Manuscript, 2007.

[22]

Luca Trevisan. Approximation algorithms for unique games. In Annual Symposium on Foundations of Computer Science, number 46, pages 197--205, 2005.

Digital Library

Cited By

Bucić MMontgomery RSaha BServedio R(2023)Towards the Erdős-Gallai Cycle Decomposition ConjectureProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585218(839-852)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585218
Richelson SRoy S(2023)Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal Binary Codes2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00021(194-205)Online publication date: 6-Nov-2023
https://doi.org/10.1109/FOCS57990.2023.00021
Jenssen MPerkins WPotukuchi A(2023)Approximately counting independent sets in bipartite graphs via graph containersRandom Structures & Algorithms10.1002/rsa.2114563:1(215-241)Online publication date: 15-Feb-2023
https://doi.org/10.1002/rsa.21145
Show More Cited By

Index Terms

Unique games on expanding constraint graphs are easy: extended abstract
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

L(2,1)-labeling of dually chordal graphs and strongly orderable graphs

An L(2,1)-labeling of a graph G=(V,E) is a function f:V(G)->{0,1,2,...} such that |f(u)-f(v)|>=2 whenever uv@__ __E(G) and |f(u)-f(v)|>=1 whenever u and v are at distance two apart. The span of an L(2,1)-labeling f of G, denoted as SP"2(f,G), is the ...
Computing Roman domatic number of graphs

We show that it is NP -complete to decide whether the Roman domatic number of a given graph is at least three.We then prove an asymptotically optimal threshold of ( log n ) for approximating the Roman domatic number of a graph.Finally, we also determine ...
Unique irredundance, domination and independent domination in graphs

A subset D of the vertex set of a graph G is irredundant if every vertex v in D has a private neighbor with respect to D, i.e. either v has a neighbor in V(G)@?D that has no other neighbor in D besides v or v itself has no neighbor in D. An irredundant ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computing

May 2008

712 pages

ISBN:9781605580470

DOI:10.1145/1374376

General Chair:
Richard Ladner
University of Washington
,
Program Chair:
Cynthia Dwork
Microsoft Research, Silicon Valley

Copyright © 2008 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 May 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

STOC '08

Sponsor:

STOC '08: Symposium on Theory of Computing

May 17 - 20, 2008

British Columbia, Victoria, Canada

Acceptance Rates

STOC '08 Paper Acceptance Rate 80 of 325 submissions, 25%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

51
Total Citations
View Citations
784
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)3

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bucić MMontgomery RSaha BServedio R(2023)Towards the Erdős-Gallai Cycle Decomposition ConjectureProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585218(839-852)Online publication date: 2-Jun-2023
Richelson SRoy S(2023)Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal Binary Codes2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00021(194-205)Online publication date: 6-Nov-2023
Jenssen MPerkins WPotukuchi A(2023)Approximately counting independent sets in bipartite graphs via graph containersRandom Structures & Algorithms10.1002/rsa.2114563:1(215-241)Online publication date: 15-Feb-2023
Minzer D(2022)On Monotonicity Testing and the 2-to-2 Games ConjectureundefinedOnline publication date: 5-Dec-2022
Braverman MMinzer D(2021)Optimal tiling of the euclidean space using permutation-symmetric bodiesProceedings of the 36th Computational Complexity Conference10.4230/LIPIcs.CCC.2021.5Online publication date: 20-Jul-2021
Bafna MBarak BKothari PSchramm TSteurer DKhuller SVassilevska Williams V(2021)Playing unique games on certified small-set expandersProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451099(1629-1642)Online publication date: 15-Jun-2021
Coulson MDavies EKolla APatel VRegts GAceto L(2020)Statistical physics approaches to unique gamesProceedings of the 35th Computational Complexity Conference10.4230/LIPIcs.CCC.2020.13(1-27)Online publication date: 28-Jul-2020
Ferber AJain V(2020)1‐Factorizations of pseudorandom graphsRandom Structures & Algorithms10.1002/rsa.2092757:2(259-278)Online publication date: 21-May-2020
Jenssen MKeevash PPerkins WChan T(2019)Algorithms for #BIS-hard problems on expander graphsProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310570(2235-2247)Online publication date: 6-Jan-2019
Dinur IHarsha PKaufman TNavon IShma AChan T(2019)List decoding with double samplersProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3310435.3310564(2134-2153)Online publication date: 6-Jan-2019
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents