Improving the complexities of approximation algorithms for optimization problems (Q1904613)
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: Improving the complexities of approximation algorithms for optimization problems |
scientific article; zbMATH DE number 829727
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improving the complexities of approximation algorithms for optimization problems |
scientific article; zbMATH DE number 829727 |
Statements
Improving the complexities of approximation algorithms for optimization problems (English)
0 references
7 January 1996
0 references
approximation scheme
0 references
computational complexities
0 references
single and parallel machine scheduling
0 references
0 references
0 references
0.90746313
0 references
0.90514785
0 references
0 references
0.90332365
0 references
0.90258104
0 references
0.89982265
0 references
