An asymptotic competitive scheme for online bin packing
From MaRDI portal
Publication:896124
DOI10.1016/J.TCS.2015.04.038zbMATH Open1332.68294OpenAlexW2136311412MaRDI QIDQ896124FDOQ896124
Deshi Ye, Guochuan Zhang, Lin Chen
Publication date: 11 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.04.038
Recommendations
- An asymptotic competitive scheme for online bin packing
- scientific article; zbMATH DE number 1756012
- On the online bin packing problem
- All-Around Near-Optimal Solutions for the Online Bin Packing Problem
- An optimal online algorithm for bounded space variable-sized bin packing
- scientific article; zbMATH DE number 1670831
- Online bin packing: old algorithms and new results
- Comparing online algorithms for bin packing problems
- scientific article; zbMATH DE number 7768353
- Online bin packing problem with buffer and bounded size revisited
Cites Work
- Title not available (Why is that?)
- Bin packing can be solved within 1+epsilon in linear time
- On the online bin packing problem
- A simple on-line bin-packing algorithm
- Lower bounds for on-line two-dimensional packing algorithms
- Fast algorithms for bin packing
- New Algorithms for Bin Packing
- On-line bin packing in linear time
- The optimal absolute ratio for online bin packing
- New Lower Bounds for Certain Classes of Bin Packing Algorithms
- Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming
- Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
- The maximum resource bin packing problem
- A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
Cited In (6)
- The optimal absolute ratio for online bin packing
- Analysis of Stochastic Online Bin Packing Processes
- Online bin packing with delay and holding costs
- An asymptotically optimal algorithm for online stacking
- Comparing online algorithms for bin packing problems
- All-Around Near-Optimal Solutions for the Online Bin Packing Problem
This page was built for publication: An asymptotic competitive scheme for online bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896124)
