Approximating Unique Games Using Low Diameter Graph Decomposition (Q5002621): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Approximating Unique Games Using Low Diameter Graph Decomposition | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2962981543 / rank | |||
Normal rank | |||
| Property / title | |||
Approximating Unique Games Using Low Diameter Graph Decomposition (English) | |||
| Property / title: Approximating Unique Games Using Low Diameter Graph Decomposition (English) / rank | |||
Normal rank | |||
Revision as of 10:05, 30 July 2024
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
