Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems (Q4497873)
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: Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems |
scientific article; zbMATH DE number 1495354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems |
scientific article; zbMATH DE number 1495354 |
Statements
Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems (English)
0 references
24 August 2000
0 references
NP-complete problem
0 references
complexity
0 references
polynomial time approximation algorithm
0 references
bin packing
0 references
coloring
0 references
covering
0 references
0.87415516
0 references
0.8605921
0 references
0.84990144
0 references
0.8429687
0 references
0.84143555
0 references
0.8387264
0 references
