Hochschulschrift
Approximation algorithms for 2-dimensional packing and related scheduling problems
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
30 cm
- Extent
-
149 S.
- Language
-
Englisch
- Notes
-
graph. Darst.
Kiel, Univ., Diss., 2013 (Nicht für den Austausch)
- Keyword
-
Informatik
- Creator
-
Robenek, Christina
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 2:04 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Robenek, Christina
Other Objects (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 geometric packing problems
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Scheduling and Packing Problems : Algorithms and Complexity
Streaming Algorithms for Bin Packing and Vector Scheduling
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Improved Approximation Algorithms for Weighted k-Set Packing
Approximation algorithms for scheduling with reservations.
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 geometric packing problems
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Scheduling and Packing Problems : Algorithms and Complexity
Streaming Algorithms for Bin Packing and Vector Scheduling
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Improved Approximation Algorithms for Weighted k-Set Packing
Approximation algorithms for scheduling with reservations.
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 geometric packing problems
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Scheduling and Packing Problems : Algorithms and Complexity
Streaming Algorithms for Bin Packing and Vector Scheduling
Tight Approximation for Resource Constrained Scheduling and Bin Packing
Improved Approximation Algorithms for Weighted k-Set Packing