- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: Lecture notes in computer science ; 855 : Springer, S. 307-318
- Erschienen in
-
Lecture notes in computer science ; 855
- Ereignis
-
Veröffentlichung
- (wo)
-
Köln
- (wer)
-
Universitäts- und Stadtbibliothek Köln
- (wann)
-
1994
- Urheber
- URN
-
urn:nbn:de:hbz:38-547032
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:30 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
- Srivastav, Anand
- Stangier, Peter
- Universitäts- und Stadtbibliothek Köln
Entstanden
- 1994
Ähnliche Objekte (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