A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks (Q5386206)
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 $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks |
scientific article; zbMATH DE number 5265797
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks |
scientific article; zbMATH DE number 5265797 |
Statements
A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks (English)
0 references
22 April 2008
0 references
scheduling
0 references
malleable tasks
0 references
polynomial approximation
0 references
performance guarantee
0 references
