Pages that link to "Item:Q3002794"
From MaRDI portal
The following pages link to Approximation algorithms for unique games (Q3002794):
Displaying 16 items.
- Small complete minors above the extremal edge density (Q313429) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- Spectral algorithms for unique games (Q645126) (← links)
- A note on unique games (Q845686) (← links)
- Games, complexity classes, and approximation algorithms. (Q1126837) (← links)
- Column subset selection problem is UG-hard (Q2637653) (← links)
- On Khot’s unique games conjecture (Q3109809) (← links)
- Subexponential Algorithms for Unique Games and Related Problems (Q3177749) (← links)
- Unique games on expanding constraint graphs are easy (extended abstract) (Q3549678) (← links)
- Playing Games with Approximation Algorithms (Q3575160) (← links)
- Improved Rounding for Parallel Repeated Unique Games (Q3588447) (← links)
- Finding and Using Expanders in Locally Sparse Graphs (Q4604650) (← links)
- Approximating Unique Games Using Low Diameter Graph Decomposition (Q5002621) (← links)
- Partitioning Well-Clustered Graphs: Spectral Clustering Works! (Q5737808) (← links)
- Linear game non-contextuality and Bell inequalities—a graph-theoretic approach (Q5855038) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)