scientific article; zbMATH DE number 7378675
From MaRDI portal
Publication:5009562
DOI10.4230/LIPIcs.ESA.2018.5MaRDI QIDQ5009562
János Balogh, Asaf Levin, György Dósa, Leah Epstein, József Békési
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1707.01728
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (25)
Lower bounds for batched bin packing ⋮ Online bin packing with overload cost ⋮ Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty ⋮ Lower bounds on the performance of online algorithms for relaxed packing problems ⋮ Open-end bin packing: new and old analysis approaches ⋮ A 4-space bounded approximation algorithm for online bin packing problem ⋮ Scheduling appointments online: the power of deferred decision-making ⋮ Parallel online algorithms for the bin packing problem ⋮ Interior-Point-Based Online Stochastic Bin Packing ⋮ On bin packing with clustering and bin packing with delays ⋮ Best fit bin packing with random order revisited ⋮ Online bin packing of squares and cubes ⋮ Online bin packing of squares and cubes ⋮ Lower bounds for several online variants of bin packing ⋮ Fully dynamic bin packing revisited ⋮ A new lower bound for classic online bin packing ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Streaming algorithms for bin packing and vector scheduling ⋮ Best Fit Bin Packing with Random Order Revisited ⋮ More on ordered open end bin packing ⋮ A Robust AFPTAS for Online Bin Packing with Polynomial Migration ⋮ A lower bound for online rectangle packing ⋮ Several methods of analysis for cardinality constrained bin packing ⋮ Comparing the costs of any fit algorithms for bin packing ⋮ Adaptive Bin Packing with Overflow
Cites Work
- Unnamed Item
- Unnamed Item
- New lower bounds for certain classes of bin packing algorithms
- A robust APTAS for the classical bin packing problem
- Bin packing can be solved within 1+epsilon in linear time
- Improved bounds for harmonic-based bin packing algorithms
- An improved lower bound for on-line bin packing algorithms
- Fast algorithms for bin packing
- Algorithms for on-line bin-packing problems with cardinality constraints
- Better Bin Packing Approximations via Discrepancy Theory
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- New Algorithms for Bin Packing
- A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
- A Logarithmic Additive Integrality Gap for Bin Packing
- Beating the Harmonic Lower Bound for Online Bin Packing
- On-line bin packing in linear time
- Optimal Analysis of Best Fit Bin Packing
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration,
- The optimal absolute ratio for online bin packing
This page was built for publication:
