A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:14, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster combinatorial approximation algorithm for scheduling unrelated parallel machines |
scientific article |
Statements
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (English)
0 references
16 July 2007
0 references
scheduling
0 references
unrelated parallel machines
0 references
approximation algorithms
0 references
unsplittable network flow
0 references
