Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations (Q1125006): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:17, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations |
scientific article |
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
