An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:48, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal rounding gives a better approximation for scheduling unrelated machines |
scientific article |
Statements
An optimal rounding gives a better approximation for scheduling unrelated machines (English)
0 references
25 August 2005
0 references
Scheduling
0 references
Unrelated machines
0 references
Approximation algorithm
0 references
Rounding
0 references
