A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Saarbrücken, Universität des Saarlandes, Dissertation, 2018
- Klassifikation
-
Mathematik
- Schlagwort
-
Algorithms
Hürth-Knapsack
- Ereignis
-
Veröffentlichung
- (wo)
-
Saarbrücken
- (wer)
-
Saarländische Universitäts- und Landesbibliothek
- (wann)
-
2018
- Urheber
-
Heydrich, Sandy
- Beteiligte Personen und Organisationen
-
Stee, Rob van
- URN
-
urn:nbn:de:bsz:291-scidok-ds-272400
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:41 MEZ
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
- Heydrich, Sandy
- Stee, Rob van
- Saarländische Universitäts- und Landesbibliothek
Entstanden
- 2018
Ähnliche Objekte (12)
Approximation algorithms for geometric packing problems
Approximation Algorithms for Geometric Packing Problems
Algorithms for geometric packing and scaling problems
Algorithms for packing problems
Two-dimensional packing problems
Algorithms for Packing Problems
Algorithmic Aspects of Packing Problems
Approximation algorithms for 2d packing problems
Generalized network improvement and packing problems
Improved Cardinality Bounds for Rectangle Packing Representations
Approximation algorithms for packing and scheduling problems
Combinatorial approaches for the trunk packing problem
Approximation algorithms for geometric packing problems
Approximation Algorithms for Geometric Packing Problems
Algorithms for geometric packing and scaling problems
Algorithms for packing problems
Two-dimensional packing problems
Algorithms for Packing Problems
Algorithmic Aspects of Packing Problems
Approximation algorithms for 2d packing problems
Generalized network improvement and packing problems
Improved Cardinality Bounds for Rectangle Packing Representations
Approximation algorithms for packing and scheduling problems
Combinatorial approaches for the trunk packing problem
Approximation algorithms for geometric packing problems
Approximation Algorithms for Geometric Packing Problems
Algorithms for geometric packing and scaling problems
Algorithms for packing problems
Two-dimensional packing problems
Algorithms for Packing Problems
Algorithmic Aspects of Packing Problems
Approximation algorithms for 2d packing problems
Generalized network improvement and packing problems
Improved Cardinality Bounds for Rectangle Packing Representations
Approximation algorithms for packing and scheduling problems