English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks

MPS-Authors
/persons/resource/persons44695

Jansen,  Klaus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45212

Porkolab,  Lorant
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Jansen, K., & Porkolab, L. (2002). Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks. Algorithmica, 32, 507-520.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2FD0-2
Abstract
There is no abstract available