Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded 
Width

Günther, Elisabeth; König, Felix; Megow, Nicole

doi:10.1007/978-3-642-12450-1_16

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width

MPS-Authors

/persons/resource/persons45020

Megow, Nicole
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

Günther, E., König, F., & Megow, N. (2010). Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width. In E. Bampis, & K. Jansen (Eds.), Approximation and Online Algorithms (pp. 170-181). Berlin: Springer. doi:10.1007/978-3-642-12450-1_16.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-16DB-F

Abstract

There is no abstract available