Monografie
Approximation algorithms for 2-dimensional packing and related scheduling problems
- Sprache
-
Englisch
- Umfang
-
149 S.
- Anmerkungen
-
Kiel, Univ., Diss., 2013 (Nicht für den Austausch)
- Identifier
-
103379757X
- Thema
-
Informatik; Hochschulschrift
- Beteiligte Personen und Organisationen
-
Robenek, Christina
- Inhaltsverzeichnis
- Rechteinformation
-
Der Zugriff auf Teile des Objekts ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.04.2024, 08:43 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.
Objekttyp
- Monografie
Beteiligte
- Robenek, Christina
Ähnliche Objekte (12)
Approximation algorithms for scheduling and two-dimensional packing problems
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Approximation algorithms for 2d packing problems
Approximation algorithms for geometric packing problems
Approximation Algorithms for Geometric Packing Problems
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Approximation algorithms for scheduling with reservations.
Approximation algorithms for linear programs and geometrically constrained packing roblems
Approximation and online algorithms in scheduling and coloring
Bounding the running time of algorithms for scheduling and packing problems.
Approximation algorithms for scheduling and two-dimensional packing problems
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Approximation algorithms for 2d packing problems
Approximation algorithms for geometric packing problems
Approximation Algorithms for Geometric Packing Problems
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Approximation algorithms for scheduling with reservations.
Approximation algorithms for linear programs and geometrically constrained packing roblems
Approximation and online algorithms in scheduling and coloring
Bounding the running time of algorithms for scheduling and packing problems.
Approximation algorithms for scheduling and two-dimensional packing problems
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Approximation algorithms for 2d packing problems
Approximation algorithms for geometric packing problems
Approximation Algorithms for Geometric Packing Problems
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Approximation algorithms for scheduling with reservations.
Approximation algorithms for linear programs and geometrically constrained packing roblems
Approximation and online algorithms in scheduling and coloring