Best fit bin packing with random order revisited
type: Item
instance of: scholarly article
title: Best fit bin packing with random order revisited
author: Susanne Albers
author: Arindam Khan
author: Leon Ladewig
published in: Algorithmica
publication date: 2021-09-02T00:00:00Z
full work available at URL: https://arxiv.org/abs/2012.00511
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7390203
zbMATH Keywords: online bin packing
zbMATH Keywords: random arrival order
zbMATH Keywords: probabilistic analysis
MaRDI profile type: Publication
OpenAlex ID: W3179773355
cites work: A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs
cites work: Best Fit Bin Packing with Random Order Revisited
cites work: Q5009562
cites work: A new lower bound for classic online bin packing
cites work: On the absolute approximation ratio for first fit and related results
cites work: Online bin covering: expectations vs. guarantees
cites work: Approximation and online algorithms for multidimensional bin packing: a survey
cites work: Random-order bin packing
cites work: Q4002885
cites work: Q2957914
cites work: Optimal Analysis of Best Fit Bin Packing
cites work: Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering
cites work: Probabilistic analysis of online (class-constrained) bin packing and bin covering
cites work: Q4133108
cites work: `` Strong '' NP-Completeness Results
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: A Logarithmic Additive Integrality Gap for Bin Packing
cites work: How to match when all vertices arrive online
cites work: Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
cites work: Online Vertex-Weighted Bipartite Matching
cites work: Fast algorithms for bin packing
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: Q4875207
cites work: A simple on-line bin-packing algorithm
cites work: Q4595047
cites work: Online bipartite matching with random arrivals
cites work: Online matching and ad allocation
cites work: Anomalous behavior in bin packing algorithms
cites work: Average-case analysis of the smart next fit algorithm
cites work: On-line bin packing in linear time
cites work: On the online bin packing problem
cites work: The average-case analysis of some on-line algorithms for bin packing
cites work: Bin packing can be solved within 1+epsilon in linear time
DOI: 10.1007/S00453-021-00844-5
description: scientific article; zbMATH DE number 7390203