Approximation hardness of optimization problems in intersection graphs of \(d\)-dimensional boxes (Q2921679)
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: Approximation hardness of optimization problems in intersection graphs of \(d\)-dimensional boxes |
scientific article; zbMATH DE number 6354837
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation hardness of optimization problems in intersection graphs of \(d\)-dimensional boxes |
scientific article; zbMATH DE number 6354837 |
Statements
13 October 2014
0 references
0 references
0.9000653
0 references
0.8799007
0 references
0.87869364
0 references
0.87869364
0 references
0.87697744
0 references
0.8751137
0 references
0.87398386
0 references
Approximation hardness of optimization problems in intersection graphs of \(d\)-dimensional boxes (English)
0 references
