Best Fit Bin Packing with Random Order Revisited
From MaRDI portal
Publication:5089165
DOI10.4230/LIPIcs.MFCS.2020.7OpenAlexW3082002725MaRDI QIDQ5089165
Susanne Albers, Leon Ladewig, Arindam Khan
Publication date: 18 July 2022
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12730/pdf/LIPIcs-MFCS-2020-7.pdf/
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online bin covering: expectations vs. guarantees
- On the absolute approximation ratio for first fit and related results
- Random-order bin packing
- Anomalous behavior in bin packing algorithms
- Average-case analysis of the smart next fit algorithm
- Bin packing can be solved within 1+epsilon in linear time
- Fast algorithms for bin packing
- Probabilistic analysis of online (class-constrained) bin packing and bin covering
- Approximation and online algorithms for multidimensional bin packing: a survey
- Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering
- Bayesian Mechanism Design
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- `` Strong NP-Completeness Results
- A Logarithmic Additive Integrality Gap for Bin Packing
- A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs
- On-line bin packing in linear time
- Online Vertex-Weighted Bipartite Matching
- Optimal Analysis of Best Fit Bin Packing
- How to match when all vertices arrive online
- Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
- Online bipartite matching with random arrivals
- Bounds on Multiprocessing Timing Anomalies
- A new lower bound for classic online bin packing
This page was built for publication: Best Fit Bin Packing with Random Order Revisited
