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 the normal view instead:
scientific article; zbMATH DE number 5171355
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster combinatorial approximation algorithm for scheduling unrelated parallel machines |
scientific article; zbMATH DE number 5171355 |
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
0 references
0.96489084
0 references
0.9551333
0 references
0.9547374
0 references
0.9517565
0 references
0.9399696
0 references
0.93831563
0 references
0 references
