Polynomial time approximation schemes for some dense instances of NP-hard optimization problems (Q5945918)
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 1657885
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time approximation schemes for some dense instances of NP-hard optimization problems |
scientific article; zbMATH DE number 1657885 |
Statements
Polynomial time approximation schemes for some dense instances of NP-hard optimization problems (English)
0 references
19 February 2002
0 references
dense instances
0 references
dense techniques
0 references
0.891006588935852
0 references
0.8289273381233215
0 references
0.7971382737159729
0 references
0.7814192175865173
0 references
