- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Best Fit Bin Packing with Random Order Revisited ; volume:83 ; number:9 ; day:1 ; month:7 ; year:2021 ; pages:2833-2858 ; date:9.2021
Algorithmica ; 83, Heft 9 (1.7.2021), 2833-2858, 9.2021
- Creator
-
Albers, Susanne
Khan, Arindam
Ladewig, Leon
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-021-00844-5
- URN
-
urn:nbn:de:101:1-2021103012052689068676
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:27 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
- Albers, Susanne
- Khan, Arindam
- Ladewig, Leon
- SpringerLink (Online service)
Other Objects (12)
On regular and random two-dimensional packing of crosses
Effective properties of composites with periodic random packing of ellipsoids
Online Algorithms for Packing Problems in the Random-Order Model
Reverse-Fit : ein approximativer Algorithmus für das Strip-Packing-Problem.
Best fit pattern matching
Best-Fit Pattern Matching
Scaling Properties of the Number of Random Sequential Adsorption Iterations Needed to Generate Saturated Random Packing
Two interfacing particles in a random potential: The random model revisited
Where Does Fouling Occur in Individual Random Packing Elements? A Simulative Investigation
Mesh Ratios for Best-Packing and Limits of Minimal Energy Configurations
Container packing
Parsers know best: German PP attachment revisited
On regular and random two-dimensional packing of crosses
Effective properties of composites with periodic random packing of ellipsoids
Online Algorithms for Packing Problems in the Random-Order Model
Reverse-Fit : ein approximativer Algorithmus für das Strip-Packing-Problem.
Best fit pattern matching
Best-Fit Pattern Matching
Scaling Properties of the Number of Random Sequential Adsorption Iterations Needed to Generate Saturated Random Packing
Two interfacing particles in a random potential: The random model revisited
Where Does Fouling Occur in Individual Random Packing Elements? A Simulative Investigation
Mesh Ratios for Best-Packing and Limits of Minimal Energy Configurations
Container packing
Parsers know best: German PP attachment revisited
On regular and random two-dimensional packing of crosses
Effective properties of composites with periodic random packing of ellipsoids
Online Algorithms for Packing Problems in the Random-Order Model
Reverse-Fit : ein approximativer Algorithmus für das Strip-Packing-Problem.
Best fit pattern matching
Best-Fit Pattern Matching
Scaling Properties of the Number of Random Sequential Adsorption Iterations Needed to Generate Saturated Random Packing
Two interfacing particles in a random potential: The random model revisited
Where Does Fouling Occur in Individual Random Packing Elements? A Simulative Investigation
Mesh Ratios for Best-Packing and Limits of Minimal Energy Configurations
Container packing