Approximating Unique Games Using Low Diameter Graph Decomposition (Q5002621)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating Unique Games Using Low Diameter Graph Decomposition |
scientific article; zbMATH DE number 7375823
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating Unique Games Using Low Diameter Graph Decomposition |
scientific article; zbMATH DE number 7375823 |
Statements
28 July 2021
0 references
unique games
0 references
low-diameter graph decomposition
0 references
bounded-genus graphs
0 references
fixed minor-free graphs
0 references
approximation algorithms
0 references
linear programming
0 references
0 references
0 references
0 references
Approximating Unique Games Using Low Diameter Graph Decomposition (English)
0 references
