Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks

Algorithmica - United States
doi 10.1007/s00453-001-0085-8
Full Text
Abstract

Available in full text

Date
Authors

Unknown

Publisher

Springer Science and Business Media LLC