Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width ; 2009, 20
Preprint Reihe Mathematik ; 2009, 20
- Klassifikation
-
Mathematik
- Urheber
-
Günther, Elisabeth
König, Felix G.
Megow, Nicole
- DOI
-
10.14279/depositonce-14432
- Handle
-
11303/15659
- URN
-
urn:nbn:de:101:1-2022011306571519859635
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:20 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Günther, Elisabeth
- König, Felix G.
- Megow, Nicole
Ähnliche Objekte (12)
Packing under balancing constraints : applications in semiconductor design and flight scheduling
Structures of bounded partition width
Structures of bounded partition width
Scheduling and Packing Under Uncertainty
Efficient 1-Space Bounded Hypercube Packing Algorithm
Packing under convex quadratic constraints
Packing under convex quadratic constraints
Online Scheduling with Bounded Migration
Scheduling and Packing Problems : Algorithms and Complexity
Approximation algorithms for packing and scheduling problems
More-Dimensional Packing with Order Constraints
Canonizing Graphs of Bounded Tree Width in Logspace
Packing under balancing constraints : applications in semiconductor design and flight scheduling
Structures of bounded partition width
Structures of bounded partition width
Scheduling and Packing Under Uncertainty
Efficient 1-Space Bounded Hypercube Packing Algorithm
Packing under convex quadratic constraints
Packing under convex quadratic constraints
Online Scheduling with Bounded Migration
Scheduling and Packing Problems : Algorithms and Complexity
Approximation algorithms for packing and scheduling problems
More-Dimensional Packing with Order Constraints
Canonizing Graphs of Bounded Tree Width in Logspace
Packing under balancing constraints : applications in semiconductor design and flight scheduling
Structures of bounded partition width
Structures of bounded partition width
Scheduling and Packing Under Uncertainty
Efficient 1-Space Bounded Hypercube Packing Algorithm
Packing under convex quadratic constraints
Packing under convex quadratic constraints
Online Scheduling with Bounded Migration
Scheduling and Packing Problems : Algorithms and Complexity
Approximation algorithms for packing and scheduling problems
More-Dimensional Packing with Order Constraints