Approximation algorithms for unique games
From MaRDI portal
Recommendations
Cited in
(24)- Games, complexity classes, and approximation algorithms.
- Column subset selection problem is UG-hard
- Near-optimal algorithms for unique games
- On Khot’s unique games conjecture
- Small complete minors above the extremal edge density
- Subexponential algorithms for unique games and related problems
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- Unique games on expanding constraint graphs are easy (extended abstract)
- Playing Games with Approximation Algorithms
- Improved Rounding for Parallel Repeated Unique Games
- Finding and using expanders in locally sparse graphs
- Approximating unique games using low diameter graph decomposition
- Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
- On unique games with negative weights
- Candidate hard unique game
- A new point of NP-hardness for unique games
- Unique games on the hypercube
- Partitioning well-clustered graphs: spectral clustering works!
- Linear game non-contextuality and Bell inequalities -- a graph-theoretic approach
- Mathematics of computation through the lens of linear equations and lattices
- Spectral algorithms for unique games
- Inapproximability of unique games in fixed-point logic with counting
- On the streaming complexity of expander decomposition
- A note on unique games
This page was built for publication: Approximation algorithms for unique games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002794)
