- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
21 cm
- Umfang
-
115 S.
- Sprache
-
Deutsch
- Anmerkungen
-
graph. Darst.
Berlin, Freie Univ., Diss., 1992
- Urheber
-
Formann, Michael
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:45 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
- Hochschulschrift
Beteiligte
- Formann, Michael
Ähnliche Objekte (12)
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for geometric packing problems
Algorithms for packing problems
Algorithms for Packing Problems
Algorithms for interval coloring, geometric packing and memory optimization
A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem
Approximation algorithms for 2d packing problems
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
New parameterized algorithms for matching and packing problems
Approximation algorithms for scheduling and two-dimensional packing problems
Contributions to Exact Algorithms for Packing and Routing Problems
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for geometric packing problems
Algorithms for packing problems
Algorithms for Packing Problems
Algorithms for interval coloring, geometric packing and memory optimization
A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem
Approximation algorithms for 2d packing problems
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
New parameterized algorithms for matching and packing problems
Approximation algorithms for scheduling and two-dimensional packing problems
Contributions to Exact Algorithms for Packing and Routing Problems
Approximation Algorithms for Geometric Packing Problems
Approximation algorithms for geometric packing problems
Algorithms for packing problems
Algorithms for Packing Problems
Algorithms for interval coloring, geometric packing and memory optimization
A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem
Approximation algorithms for 2d packing problems
Approximation algorithms for packing and scheduling problems
Improved approximation algorithms for packing and scheduling problems
New parameterized algorithms for matching and packing problems
Approximation algorithms for scheduling and two-dimensional packing problems