Fully polynomial time approximation schemes for scheduling divisible loads (Q3583567)
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: Fully polynomial time approximation schemes for scheduling divisible loads |
scientific article; zbMATH DE number 5772029
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fully polynomial time approximation schemes for scheduling divisible loads |
scientific article; zbMATH DE number 5772029 |
Statements
Fully Polynomial Time Approximation Schemes for Scheduling Divisible Loads (English)
0 references
17 August 2010
0 references
scheduling
0 references
divisible loads
0 references
FPTAS
0 references
0.8076278567314148
0 references
0.8066466450691223
0 references
0.8058834671974182
0 references
