NP-Complete operations research problems and approximation algorithms (Q4187586)
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: NP-Complete operations research problems and approximation algorithms |
scientific article; zbMATH DE number 3625119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-Complete operations research problems and approximation algorithms |
scientific article; zbMATH DE number 3625119 |
Statements
NP-Complete operations research problems and approximation algorithms (English)
0 references
1979
0 references
Np-Complete
0 references
Approximation Algorithms
0 references
Computational Complexity
0 references
Worst- Case Analysis
0 references
Knapsack Problem
0 references
Combinatorial Optimization
0 references
0 references
0 references
0 references
0 references
