A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738): Difference between revisions
From MaRDI portal
Latest revision as of 11:13, 26 June 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
0 references
0 references