Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations (Q1125006)
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: Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations |
scientific article; zbMATH DE number 1371496
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations |
scientific article; zbMATH DE number 1371496 |
Statements
Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations (English)
0 references
15 March 2000
0 references
approximation algorithm
0 references
sequential selection
0 references
knapsack problem
0 references
maximum subset sum problem
0 references
average-case performance
0 references
on-line approximation algorithm
0 references
recurrence relations
0 references
job scheduling
0 references
multiprogrammed parallel systems
0 references
0 references
