de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45020

Megow,  Nicole
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
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: http://hdl.handle.net/11858/00-001M-0000-000F-16DB-F
Abstract
There is no abstract available