Improved approximation algorithms for label cover problems (Q634686)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5939454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation algorithms for label cover problems |
scientific article; zbMATH DE number 5939454 |
Statements
Improved approximation algorithms for label cover problems (English)
0 references
16 August 2011
0 references
\textsc{Label Cover}
0 references
approximation algorithm
0 references
hardness of approximation
0 references
\textsc{Min Rep}
0 references
\textsc{Max Rep}
0 references
\textsc{Densest \(k\)-Subgraph}
0 references
0 references
0 references
0.9945816397666932
0 references
0.8429481387138367
0 references
0.8350474238395691
0 references
0.8326079249382019
0 references
