An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212)
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: An optimal rounding gives a better approximation for scheduling unrelated machines |
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
0 references
