Inapproximability of combinatorial optimization problems (Q3059320)
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 5823941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inapproximability of combinatorial optimization problems |
scientific article; zbMATH DE number 5823941 |
Statements
8 December 2010
0 references
NP-hard
0 references
0.8574222326278687
0 references
0.8537753820419312
0 references
0.8474136590957642
0 references
