On the public citation graph

How to Play Unique Games Using Embeddings

0 signed · 64 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1109/ccc.2002.1004334openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.1109/sfcs.2005.22openalex-snapshot
Approximation Algorithms for Unique Games
inferredcites →https://doi.org/10.1137/s0097539705447372openalex-snapshot
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
inferredcites →https://doi.org/10.1145/1007352.1007355openalex-snapshot
Expander flows, geometric embeddings and graph partitioning
inferredcites →https://doi.org/10.1145/1060590.1060673openalex-snapshot
Euclidean distortion and the sparsest cut
inferredcites →https://doi.org/10.1145/1060590.1060675openalex-snapshot
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
inferredcites →https://doi.org/10.1145/1132516.1132547openalex-snapshot
Near-optimal algorithms for unique games
inferredcites →https://doi.org/10.1145/167088.167266openalex-snapshot
Approximate max-flow min-(multi)cut theorems and their applications
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1145/509907.510017openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.5555/1070432.1070446openalex-snapshot
On distance scales, embeddings, and efficient relaxations of the cut cone
inferredcites →https://doi.org/10.5555/1070432.1070447openalex-snapshot
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
inferredcites →https://doi.org/10.5555/1109557.1109569openalex-snapshot
Approximating unique games

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0755openalex-snapshot
Semidefinite Optimization Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-17953-3_2openalex-snapshot
Min-Max Correlation Clustering via MultiCut
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_17openalex-snapshot
Coarse Differentiation and Multi-flows in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-18318-8_17openalex-snapshot
How to Play Unique Games on Expanders
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_67openalex-snapshot
Nonuniform Graph Partitioning with Unrelated Weights
inferred← citeshttps://doi.org/10.1007/978-981-96-1093-8_17openalex-snapshot
Efficient Partitioning Algorithms for Optimizing Big Graph Computation
inferred← citeshttps://doi.org/10.1007/s00037-011-0011-7openalex-snapshot
Spectral Algorithms for Unique Games
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.03.004openalex-snapshot
Approximation algorithms for the Weighted t-Uniform Sparsest Cut and some other graph partitioning problems
inferred← citeshttps://doi.org/10.1017/cbo9780511921735openalex-snapshot
The Design of Approximation Algorithms
inferred← citeshttps://doi.org/10.1070/sm8903openalex-snapshot
Minimum nonuniform graph partitioning with unrelated weights
inferred← citeshttps://doi.org/10.1109/ccc.2010.19openalex-snapshot
On the Unique Games Conjecture (Invited Survey)
inferred← citeshttps://doi.org/10.1109/ccc.2010.20openalex-snapshot
Spectral Algorithms for Unique Games
inferred← citeshttps://doi.org/10.1109/focs.2008.55openalex-snapshot
Rounding Parallel Repetitions of Unique Games
inferred← citeshttps://doi.org/10.1109/focs.2008.9openalex-snapshot
Unique Games with Entangled Provers are Easy
inferred← citeshttps://doi.org/10.1109/focs.2009.74openalex-snapshot
How to Round Any CSP
inferred← citeshttps://doi.org/10.1109/focs.2010.59openalex-snapshot
Subexponential Algorithms for Unique Games and Related Problems
inferred← citeshttps://doi.org/10.1109/focs.2011.78openalex-snapshot
How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games
inferred← citeshttps://doi.org/10.1109/focs.2011.79openalex-snapshot
Min-max Graph Partitioning and Small Set Expansion
inferred← citeshttps://doi.org/10.1109/focs.2013.37openalex-snapshot
Towards a Better Approximation for Sparsest Cut?
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00009openalex-snapshot
On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs
inferred← citeshttps://doi.org/10.1109/sfcs.2005.61openalex-snapshot
On the Unique Games Conjecture
inferred← citeshttps://doi.org/10.1137/080734042openalex-snapshot
Parallel Repetition in Projection Games and a Concentration Bound
inferred← citeshttps://doi.org/10.1137/1.9781611973068.102openalex-snapshot
Partitioning Graphs into Balanced Components
inferred← citeshttps://doi.org/10.1137/1.9781611973402.92openalex-snapshot
Approximation Algorithm for Sparsest k-Partitioning
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch105openalex-snapshot
Integrality Gaps and Approximation Algorithms for Dispersers and Bipartite Expanders
inferred← citeshttps://doi.org/10.1137/1.9781611976465.26openalex-snapshot
Approximation Algorithms and Hardness for Strong Unique Games
inferred← citeshttps://doi.org/10.1137/19m1276650openalex-snapshot
List-Decoding with Double Samplers
inferred← citeshttps://doi.org/10.1145/1132516.1132567openalex-snapshot
Conditional hardness for approximate coloring
inferred← citeshttps://doi.org/10.1145/1250790.1250882openalex-snapshot
Vertex cuts, random walks, and dimension reduction in series-parallel graphs
inferred← citeshttps://doi.org/10.1145/1374376.1374380openalex-snapshot
Unique games on expanding constraint graphs are easy
inferred← citeshttps://doi.org/10.1145/1374376.1374414openalex-snapshot
Optimal algorithms and inapproximability results for every CSP?
inferred← citeshttps://doi.org/10.1145/1806689.1806775openalex-snapshot
Bilipschitz snowflakes and metrics of negative type
inferred← citeshttps://doi.org/10.1145/1806689.1806776openalex-snapshot
Approximations for the isoperimetric and spectral profile of graphs and related parameters
inferred← citeshttps://doi.org/10.1145/1993636.1993737openalex-snapshot
Near-optimal distortion bounds for embedding doubling spaces into L 1
inferred← citeshttps://doi.org/10.1145/2775105openalex-snapshot
Subexponential Algorithms for Unique Games and Related Problems
inferred← citeshttps://doi.org/10.1145/3188745.3188828openalex-snapshot
Nonlinear dimension reduction via outer Bi-Lipschitz extensions
inferred← citeshttps://doi.org/10.4086/cjtcs.2015.001openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2008.v004a005openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2014.v010a003openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2014.v010a013openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2016.v012a017openalex-snapshot
inferred← citeshttps://doi.org/10.4213/sm8903openalex-snapshot
Задача минимального неравномерного разбиения графа на части c несвязанными весами
inferred← citeshttps://doi.org/10.4230/dagsemproc.07411.6openalex-snapshot
The Unique Games Conjecture with Entangled Provers is False
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.64openalex-snapshot
Reduction From Non-Unique Games To Boolean Unique Games
inferred← citeshttps://doi.org/10.48550/arxiv.0710.0655openalex-snapshot
Unique Games with Entangled Provers are Easy
inferred← citeshttps://doi.org/10.48550/arxiv.1102.1456openalex-snapshot
A Reformulation of the Arora-Rao-Vazirani Structure Theorem
inferred← citeshttps://doi.org/10.48550/arxiv.1104.3806openalex-snapshot
How to Play Unique Games against a Semi-Random Adversary
inferred← citeshttps://doi.org/10.48550/arxiv.1110.4319openalex-snapshot
Min-Max Graph Partitioning and Small Set Expansion
inferred← citeshttps://doi.org/10.48550/arxiv.1401.0699openalex-snapshot
Nonuniform Graph Partitioning with Unrelated Weights
inferred← citeshttps://doi.org/10.48550/arxiv.1907.00117openalex-snapshot
Min-Max Correlation Clustering via MultiCut
inferred← citeshttps://doi.org/10.5555/1496770.1496872openalex-snapshot
Partitioning graphs into balanced components
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.