NP-Complete operations research problems and approximation algorithms (Q4187586): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:37, 6 February 2024
scientific article; zbMATH DE number 3625119
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
