A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738)
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: A faster combinatorial approximation algorithm for scheduling unrelated parallel machines |
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
