Tight Approximation Algorithms for Maximum Separable Assignment Problems (Q2884281)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight Approximation Algorithms for Maximum Separable Assignment Problems |
scientific article |
Statements
Tight Approximation Algorithms for Maximum Separable Assignment Problems (English)
0 references
24 May 2012
0 references
approximation algorithms
0 references
assignment problems
0 references
knapsack problem
0 references
linear programming
0 references
hardness results
0 references
