Fast Approximation Algorithms for Knapsack Problems (Q3861164): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: DBLP publication ID (P1635): journals/mor/Lawler79, #quickstatements; #temporary_batch_1731543907597 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/mor/Lawler79 / rank | |||
Normal rank | |||
Revision as of 01:56, 14 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast Approximation Algorithms for Knapsack Problems |
scientific article |
Statements
Fast Approximation Algorithms for Knapsack Problems (English)
0 references
1979
0 references
NP-complete problems
0 references
knapsack problem
0 references
subset sum problem
0 references
fully polynomial approximation schemes
0 references
approximate solution
0 references
