Best Fit Bin Packing with Random Order Revisited
Work
Year: 2021
Type: article
Abstract: Best Fit is a well known online algorithm for the bin packing problem, where a collection of one-dimensional items has to be packed into a minimum number of unit-sized bins. In a seminal work, Kenyon ... more
Source: Algorithmica
Authors Susanne Albers, Arindam Khan, Leon Ladewig
Cites: 43
Cited by: 12
Related to: 10
FWCI: 1.583
Citation percentile (by year/subfield): 69.77
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,890