- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: Lecture notes in computer science ; 855 : Springer, S. 307-318
- Bibliographic citation
-
Lecture notes in computer science ; 855
- Event
-
Veröffentlichung
- (where)
-
Köln
- (who)
-
Universitäts- und Stadtbibliothek Köln
- (when)
-
1994
- Creator
- URN
-
urn:nbn:de:hbz:38-547032
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:30 AM 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.
Associated
- Srivastav, Anand
- Stangier, Peter
- Universitäts- und Stadtbibliothek Köln
Time of origin
- 1994
Other Objects (12)
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Approximation algorithms for scheduling and two-dimensional packing problems
Approximation algorithms for linear programs and geometrically constrained packing roblems
Approximation algorithms for 2-dimensional packing and related scheduling problems
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Tight approximation algorithms for scheduling with fixed jobs and non-availability.
Tight Approximation Algorithms for Scheduling with Fixed Jobs and Non-Availability.
Scheduling and Packing Under Uncertainty
Approximation algorithms for geometric packing problems
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Approximation algorithms for scheduling and two-dimensional packing problems
Approximation algorithms for linear programs and geometrically constrained packing roblems
Approximation algorithms for 2-dimensional packing and related scheduling problems
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Tight approximation algorithms for scheduling with fixed jobs and non-availability.
Tight Approximation Algorithms for Scheduling with Fixed Jobs and Non-Availability.
Scheduling and Packing Under Uncertainty
Approximation algorithms for geometric packing problems
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for 2d packing problems
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
Approximation algorithms for scheduling and two-dimensional packing problems
Approximation algorithms for linear programs and geometrically constrained packing roblems
Approximation algorithms for 2-dimensional packing and related scheduling problems
Approximation Algorithms for 2-dimensional Packing and Related Scheduling Problems
Tight approximation algorithms for scheduling with fixed jobs and non-availability.
Tight Approximation Algorithms for Scheduling with Fixed Jobs and Non-Availability.
Scheduling and Packing Under Uncertainty
Approximation algorithms for geometric packing problems
Approximation Algorithms for Geometric Packing Problems