Tight Approximation Algorithms for Maximum Separable Assignment Problems (Q2884281): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Vahab S. Mirrokni / rank | |||
| Property / author | |||
| Property / author: Vahab S. Mirrokni / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054428995 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:23, 20 March 2024
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
