A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks (Q5386206): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Christophe Rapine / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Denis Trystram / rank | |||
Normal rank | |||
Revision as of 23:09, 12 February 2024
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
