Tight approximation algorithms for maximum separable assignment problems (Q2884281)
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: Tight approximation algorithms for maximum separable assignment problems |
scientific article; zbMATH DE number 6038595
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight approximation algorithms for maximum separable assignment problems |
scientific article; zbMATH DE number 6038595 |
Statements
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
0.9070963
0 references
0.90691006
0 references
0.89699656
0 references
0 references
0 references
0.88794154
0 references
0.8869901
0 references
Tight approximation algorithms for maximum separable assignment problems (English)
0 references
