Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme

Klaus Jansen. Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme. Algorithmica, 39(1):59-81, 2004. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.