Improved approximation algorithms for the combination problem of parallel machine scheduling and path (Q2331579)
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 7124097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation algorithms for the combination problem of parallel machine scheduling and path |
scientific article; zbMATH DE number 7124097 |
Statements
Improved approximation algorithms for the combination problem of parallel machine scheduling and path (English)
0 references
29 October 2019
0 references
parallel machine scheduling
0 references
shortest path
0 references
approximation algorithm
0 references
polynomial time approximation scheme
0 references
0.8400137424468994
0 references
0.8248409628868103
0 references
0.8240912556648254
0 references
0.822454571723938
0 references
0.8196694254875183
0 references
